./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/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 7540c95af84ce36a44a847aa5fc0422896a0f0bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:10:27,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:10:27,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:10:27,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:10:27,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:10:27,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:10:27,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:10:27,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:10:27,704 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:10:27,704 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:10:27,705 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:10:27,705 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:10:27,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:10:27,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:10:27,707 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:10:27,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:10:27,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:10:27,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:10:27,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:10:27,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:10:27,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:10:27,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:10:27,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:10:27,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:10:27,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:10:27,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:10:27,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:10:27,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:10:27,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:10:27,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:10:27,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:10:27,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:10:27,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:10:27,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:10:27,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:10:27,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:10:27,721 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:10:27,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:10:27,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:10:27,732 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:10:27,732 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:10:27,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:10:27,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:10:27,732 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:10:27,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:10:27,733 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:10:27,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:10:27,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:10:27,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:10:27,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:10:27,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:10:27,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:10:27,734 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:10:27,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:10:27,734 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:10:27,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:10:27,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:10:27,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:10:27,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:10:27,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:10:27,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:10:27,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:10:27,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:10:27,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:10:27,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:10:27,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:10:27,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:10:27,736 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_3d8d8684-584a-49a9-8906-4d694e62bdc9/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 -> 7540c95af84ce36a44a847aa5fc0422896a0f0bd [2018-11-28 12:10:27,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:10:27,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:10:27,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:10:27,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:10:27,773 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:10:27,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-11-28 12:10:27,818 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/data/4086b8e5e/85aa6233674b4832a9bac827b5ec8709/FLAG234ebc116 [2018-11-28 12:10:28,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:10:28,220 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-11-28 12:10:28,232 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/data/4086b8e5e/85aa6233674b4832a9bac827b5ec8709/FLAG234ebc116 [2018-11-28 12:10:28,584 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/data/4086b8e5e/85aa6233674b4832a9bac827b5ec8709 [2018-11-28 12:10:28,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:10:28,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:10:28,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:10:28,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:10:28,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:10:28,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:10:28" (1/1) ... [2018-11-28 12:10:28,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486872ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:28, skipping insertion in model container [2018-11-28 12:10:28,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:10:28" (1/1) ... [2018-11-28 12:10:28,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:10:28,629 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:10:28,912 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:10:28,919 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:10:28,998 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:10:29,068 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:10:29,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29 WrapperNode [2018-11-28 12:10:29,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:10:29,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:10:29,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:10:29,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:10:29,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:10:29,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:10:29,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:10:29,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:10:29,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... [2018-11-28 12:10:29,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:10:29,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:10:29,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:10:29,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:10:29,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:10:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:10:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:10:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:10:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-11-28 12:10:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-11-28 12:10:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-11-28 12:10:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-11-28 12:10:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-11-28 12:10:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-11-28 12:10:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-11-28 12:10:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-11-28 12:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:10:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:10:29,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:10:29,162 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 12:10:29,460 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:10:29,460 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 12:10:29,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:29 BoogieIcfgContainer [2018-11-28 12:10:29,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:10:29,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:10:29,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:10:29,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:10:29,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:10:28" (1/3) ... [2018-11-28 12:10:29,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e44fab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:10:29, skipping insertion in model container [2018-11-28 12:10:29,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:29" (2/3) ... [2018-11-28 12:10:29,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e44fab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:10:29, skipping insertion in model container [2018-11-28 12:10:29,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:29" (3/3) ... [2018-11-28 12:10:29,465 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2018-11-28 12:10:29,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,490 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,490 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,495 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,496 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,497 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,498 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,499 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,500 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,501 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,501 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,501 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,501 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,501 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,501 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,502 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,502 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,502 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,502 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,502 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,502 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,504 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,505 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,506 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,506 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,506 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:10:29,637 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 12:10:29,637 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:10:29,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:10:29,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:10:29,670 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:10:29,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:10:29,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:10:29,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:10:29,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:10:29,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:10:29,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:10:29,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:10:29,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:10:29,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2018-11-28 12:10:32,190 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2018-11-28 12:10:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2018-11-28 12:10:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:10:32,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:32,201 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] [2018-11-28 12:10:32,203 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:32,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2057999791, now seen corresponding path program 1 times [2018-11-28 12:10:32,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:32,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:32,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:32,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:32,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:10:32,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:10:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:10:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:10:32,422 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 5 states. [2018-11-28 12:10:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:33,191 INFO L93 Difference]: Finished difference Result 53970 states and 232571 transitions. [2018-11-28 12:10:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:10:33,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-28 12:10:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:33,401 INFO L225 Difference]: With dead ends: 53970 [2018-11-28 12:10:33,401 INFO L226 Difference]: Without dead ends: 38045 [2018-11-28 12:10:33,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:10:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38045 states. [2018-11-28 12:10:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38045 to 31406. [2018-11-28 12:10:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2018-11-28 12:10:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 135820 transitions. [2018-11-28 12:10:34,591 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 135820 transitions. Word has length 31 [2018-11-28 12:10:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:34,592 INFO L480 AbstractCegarLoop]: Abstraction has 31406 states and 135820 transitions. [2018-11-28 12:10:34,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:10:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 135820 transitions. [2018-11-28 12:10:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:10:34,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:34,594 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] [2018-11-28 12:10:34,594 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:34,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 973446305, now seen corresponding path program 2 times [2018-11-28 12:10:34,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:34,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:34,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:34,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:34,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:10:34,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:10:34,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:10:34,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:10:34,737 INFO L87 Difference]: Start difference. First operand 31406 states and 135820 transitions. Second operand 10 states. [2018-11-28 12:10:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:35,517 INFO L93 Difference]: Finished difference Result 38063 states and 167101 transitions. [2018-11-28 12:10:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:10:35,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-28 12:10:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:35,628 INFO L225 Difference]: With dead ends: 38063 [2018-11-28 12:10:35,628 INFO L226 Difference]: Without dead ends: 38063 [2018-11-28 12:10:35,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:10:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38063 states. [2018-11-28 12:10:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38063 to 31406. [2018-11-28 12:10:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2018-11-28 12:10:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 135820 transitions. [2018-11-28 12:10:36,185 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 135820 transitions. Word has length 31 [2018-11-28 12:10:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:36,185 INFO L480 AbstractCegarLoop]: Abstraction has 31406 states and 135820 transitions. [2018-11-28 12:10:36,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:10:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 135820 transitions. [2018-11-28 12:10:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:10:36,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:36,187 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] [2018-11-28 12:10:36,187 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:36,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash -320847025, now seen corresponding path program 3 times [2018-11-28 12:10:36,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:36,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:36,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:36,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:36,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:10:36,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:10:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:10:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:10:36,304 INFO L87 Difference]: Start difference. First operand 31406 states and 135820 transitions. Second operand 10 states. [2018-11-28 12:10:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:36,928 INFO L93 Difference]: Finished difference Result 44676 states and 198308 transitions. [2018-11-28 12:10:36,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:10:36,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-28 12:10:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:37,020 INFO L225 Difference]: With dead ends: 44676 [2018-11-28 12:10:37,020 INFO L226 Difference]: Without dead ends: 44676 [2018-11-28 12:10:37,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:10:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44676 states. [2018-11-28 12:10:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44676 to 31363. [2018-11-28 12:10:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2018-11-28 12:10:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2018-11-28 12:10:37,707 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2018-11-28 12:10:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:37,707 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2018-11-28 12:10:37,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:10:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2018-11-28 12:10:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 12:10:37,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:37,713 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] [2018-11-28 12:10:37,713 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:37,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1852887775, now seen corresponding path program 1 times [2018-11-28 12:10:37,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:37,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:37,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:37,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:37,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:10:37,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:10:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:10:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:10:37,775 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 5 states. [2018-11-28 12:10:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:38,148 INFO L93 Difference]: Finished difference Result 37553 states and 163554 transitions. [2018-11-28 12:10:38,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:10:38,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-28 12:10:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:38,225 INFO L225 Difference]: With dead ends: 37553 [2018-11-28 12:10:38,225 INFO L226 Difference]: Without dead ends: 37553 [2018-11-28 12:10:38,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:10:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37553 states. [2018-11-28 12:10:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37553 to 35090. [2018-11-28 12:10:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35090 states. [2018-11-28 12:10:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35090 states to 35090 states and 153591 transitions. [2018-11-28 12:10:38,793 INFO L78 Accepts]: Start accepts. Automaton has 35090 states and 153591 transitions. Word has length 41 [2018-11-28 12:10:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:38,793 INFO L480 AbstractCegarLoop]: Abstraction has 35090 states and 153591 transitions. [2018-11-28 12:10:38,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:10:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 35090 states and 153591 transitions. [2018-11-28 12:10:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 12:10:38,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:38,796 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] [2018-11-28 12:10:38,796 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:38,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash 931900819, now seen corresponding path program 2 times [2018-11-28 12:10:38,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:38,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:38,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:10:38,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:10:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:10:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:10:38,857 INFO L87 Difference]: Start difference. First operand 35090 states and 153591 transitions. Second operand 6 states. [2018-11-28 12:10:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:39,238 INFO L93 Difference]: Finished difference Result 74225 states and 316462 transitions. [2018-11-28 12:10:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:10:39,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-28 12:10:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:39,327 INFO L225 Difference]: With dead ends: 74225 [2018-11-28 12:10:39,327 INFO L226 Difference]: Without dead ends: 46038 [2018-11-28 12:10:39,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:10:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46038 states. [2018-11-28 12:10:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46038 to 35487. [2018-11-28 12:10:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35487 states. [2018-11-28 12:10:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35487 states to 35487 states and 149277 transitions. [2018-11-28 12:10:40,217 INFO L78 Accepts]: Start accepts. Automaton has 35487 states and 149277 transitions. Word has length 41 [2018-11-28 12:10:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:40,217 INFO L480 AbstractCegarLoop]: Abstraction has 35487 states and 149277 transitions. [2018-11-28 12:10:40,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:10:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 35487 states and 149277 transitions. [2018-11-28 12:10:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 12:10:40,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:40,228 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] [2018-11-28 12:10:40,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:40,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2024466476, now seen corresponding path program 1 times [2018-11-28 12:10:40,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:40,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:40,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:40,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:10:40,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:10:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:10:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:10:40,339 INFO L87 Difference]: Start difference. First operand 35487 states and 149277 transitions. Second operand 7 states. [2018-11-28 12:10:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:40,691 INFO L93 Difference]: Finished difference Result 42305 states and 178055 transitions. [2018-11-28 12:10:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:10:40,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-28 12:10:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:40,768 INFO L225 Difference]: With dead ends: 42305 [2018-11-28 12:10:40,768 INFO L226 Difference]: Without dead ends: 42233 [2018-11-28 12:10:40,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:10:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42233 states. [2018-11-28 12:10:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42233 to 35466. [2018-11-28 12:10:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2018-11-28 12:10:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2018-11-28 12:10:41,319 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2018-11-28 12:10:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:41,319 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2018-11-28 12:10:41,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:10:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2018-11-28 12:10:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 12:10:41,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:41,326 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] [2018-11-28 12:10:41,326 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:41,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1156791892, now seen corresponding path program 2 times [2018-11-28 12:10:41,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:41,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:41,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:41,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:41,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:10:41,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:10:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:10:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:10:41,420 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2018-11-28 12:10:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:42,043 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2018-11-28 12:10:42,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:10:42,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-28 12:10:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:42,123 INFO L225 Difference]: With dead ends: 49948 [2018-11-28 12:10:42,123 INFO L226 Difference]: Without dead ends: 45132 [2018-11-28 12:10:42,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:10:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2018-11-28 12:10:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2018-11-28 12:10:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2018-11-28 12:10:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2018-11-28 12:10:42,682 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2018-11-28 12:10:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:42,683 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2018-11-28 12:10:42,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:10:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2018-11-28 12:10:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:10:42,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:42,690 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] [2018-11-28 12:10:42,690 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:42,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash 819464228, now seen corresponding path program 1 times [2018-11-28 12:10:42,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:42,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:42,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:42,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:42,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:10:42,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:10:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:10:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:10:42,751 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 5 states. [2018-11-28 12:10:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:42,973 INFO L93 Difference]: Finished difference Result 41392 states and 173197 transitions. [2018-11-28 12:10:42,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:10:42,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-28 12:10:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:43,047 INFO L225 Difference]: With dead ends: 41392 [2018-11-28 12:10:43,047 INFO L226 Difference]: Without dead ends: 40912 [2018-11-28 12:10:43,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:10:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40912 states. [2018-11-28 12:10:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40912 to 38964. [2018-11-28 12:10:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38964 states. [2018-11-28 12:10:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38964 states to 38964 states and 164377 transitions. [2018-11-28 12:10:43,625 INFO L78 Accepts]: Start accepts. Automaton has 38964 states and 164377 transitions. Word has length 44 [2018-11-28 12:10:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:43,626 INFO L480 AbstractCegarLoop]: Abstraction has 38964 states and 164377 transitions. [2018-11-28 12:10:43,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:10:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 38964 states and 164377 transitions. [2018-11-28 12:10:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:10:43,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:43,635 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] [2018-11-28 12:10:43,635 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:43,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:43,635 INFO L82 PathProgramCache]: Analyzing trace with hash 868178546, now seen corresponding path program 2 times [2018-11-28 12:10:43,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:43,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:43,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:43,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:43,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:43,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:43,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:10:43,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:10:43,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:10:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:10:43,748 INFO L87 Difference]: Start difference. First operand 38964 states and 164377 transitions. Second operand 7 states. [2018-11-28 12:10:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:44,108 INFO L93 Difference]: Finished difference Result 41851 states and 174247 transitions. [2018-11-28 12:10:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:10:44,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-11-28 12:10:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:44,186 INFO L225 Difference]: With dead ends: 41851 [2018-11-28 12:10:44,186 INFO L226 Difference]: Without dead ends: 41371 [2018-11-28 12:10:44,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:10:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41371 states. [2018-11-28 12:10:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41371 to 36092. [2018-11-28 12:10:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2018-11-28 12:10:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2018-11-28 12:10:44,936 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2018-11-28 12:10:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:44,936 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2018-11-28 12:10:44,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:10:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2018-11-28 12:10:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:10:44,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:44,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:44,944 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:44,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -108546428, now seen corresponding path program 3 times [2018-11-28 12:10:44,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:44,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:44,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:44,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:45,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:45,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 12:10:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:10:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:10:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:10:45,283 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2018-11-28 12:10:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:46,137 INFO L93 Difference]: Finished difference Result 43003 states and 180466 transitions. [2018-11-28 12:10:46,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:10:46,138 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-28 12:10:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:46,219 INFO L225 Difference]: With dead ends: 43003 [2018-11-28 12:10:46,219 INFO L226 Difference]: Without dead ends: 42757 [2018-11-28 12:10:46,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-11-28 12:10:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42757 states. [2018-11-28 12:10:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42757 to 39101. [2018-11-28 12:10:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39101 states. [2018-11-28 12:10:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39101 states to 39101 states and 165551 transitions. [2018-11-28 12:10:46,852 INFO L78 Accepts]: Start accepts. Automaton has 39101 states and 165551 transitions. Word has length 44 [2018-11-28 12:10:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:46,853 INFO L480 AbstractCegarLoop]: Abstraction has 39101 states and 165551 transitions. [2018-11-28 12:10:46,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:10:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 39101 states and 165551 transitions. [2018-11-28 12:10:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:10:46,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:46,865 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] [2018-11-28 12:10:46,865 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:46,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1310405846, now seen corresponding path program 4 times [2018-11-28 12:10:46,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:46,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:47,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:10:47,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:10:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:10:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:10:47,055 INFO L87 Difference]: Start difference. First operand 39101 states and 165551 transitions. Second operand 14 states. [2018-11-28 12:10:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:47,502 INFO L93 Difference]: Finished difference Result 52387 states and 222062 transitions. [2018-11-28 12:10:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:10:47,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-28 12:10:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:47,604 INFO L225 Difference]: With dead ends: 52387 [2018-11-28 12:10:47,604 INFO L226 Difference]: Without dead ends: 52141 [2018-11-28 12:10:47,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:10:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52141 states. [2018-11-28 12:10:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52141 to 39028. [2018-11-28 12:10:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2018-11-28 12:10:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2018-11-28 12:10:48,449 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 44 [2018-11-28 12:10:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:48,449 INFO L480 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2018-11-28 12:10:48,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:10:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2018-11-28 12:10:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:10:48,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:48,463 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] [2018-11-28 12:10:48,463 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:48,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1031346498, now seen corresponding path program 1 times [2018-11-28 12:10:48,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:48,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:48,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:48,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:48,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:10:48,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:10:48,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:10:48,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:10:48,702 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 12 states. [2018-11-28 12:10:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:49,185 INFO L93 Difference]: Finished difference Result 55533 states and 228155 transitions. [2018-11-28 12:10:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:10:49,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-28 12:10:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:49,276 INFO L225 Difference]: With dead ends: 55533 [2018-11-28 12:10:49,276 INFO L226 Difference]: Without dead ends: 48889 [2018-11-28 12:10:49,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-11-28 12:10:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48889 states. [2018-11-28 12:10:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48889 to 38756. [2018-11-28 12:10:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38756 states. [2018-11-28 12:10:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38756 states to 38756 states and 164262 transitions. [2018-11-28 12:10:49,914 INFO L78 Accepts]: Start accepts. Automaton has 38756 states and 164262 transitions. Word has length 46 [2018-11-28 12:10:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:49,914 INFO L480 AbstractCegarLoop]: Abstraction has 38756 states and 164262 transitions. [2018-11-28 12:10:49,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:10:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38756 states and 164262 transitions. [2018-11-28 12:10:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:10:49,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:49,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] [2018-11-28 12:10:49,928 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:49,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash -165686462, now seen corresponding path program 1 times [2018-11-28 12:10:49,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:49,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:50,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:50,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 12:10:50,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:10:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:10:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:10:50,378 INFO L87 Difference]: Start difference. First operand 38756 states and 164262 transitions. Second operand 17 states. [2018-11-28 12:10:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:51,356 INFO L93 Difference]: Finished difference Result 47709 states and 201870 transitions. [2018-11-28 12:10:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:10:51,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-28 12:10:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:51,445 INFO L225 Difference]: With dead ends: 47709 [2018-11-28 12:10:51,445 INFO L226 Difference]: Without dead ends: 47403 [2018-11-28 12:10:51,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-28 12:10:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47403 states. [2018-11-28 12:10:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47403 to 40796. [2018-11-28 12:10:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40796 states. [2018-11-28 12:10:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40796 states to 40796 states and 173951 transitions. [2018-11-28 12:10:52,152 INFO L78 Accepts]: Start accepts. Automaton has 40796 states and 173951 transitions. Word has length 46 [2018-11-28 12:10:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:52,153 INFO L480 AbstractCegarLoop]: Abstraction has 40796 states and 173951 transitions. [2018-11-28 12:10:52,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:10:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40796 states and 173951 transitions. [2018-11-28 12:10:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:10:52,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:52,171 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] [2018-11-28 12:10:52,171 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:52,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1433815393, now seen corresponding path program 1 times [2018-11-28 12:10:52,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:52,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:52,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:52,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:52,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:52,747 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-28 12:10:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:52,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:52,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 12:10:52,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:10:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:10:52,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:10:52,872 INFO L87 Difference]: Start difference. First operand 40796 states and 173951 transitions. Second operand 17 states. [2018-11-28 12:10:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:53,759 INFO L93 Difference]: Finished difference Result 48941 states and 207557 transitions. [2018-11-28 12:10:53,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 12:10:53,759 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-28 12:10:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:53,848 INFO L225 Difference]: With dead ends: 48941 [2018-11-28 12:10:53,848 INFO L226 Difference]: Without dead ends: 48635 [2018-11-28 12:10:53,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-11-28 12:10:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2018-11-28 12:10:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 40772. [2018-11-28 12:10:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2018-11-28 12:10:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2018-11-28 12:10:54,476 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2018-11-28 12:10:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:54,476 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2018-11-28 12:10:54,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:10:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2018-11-28 12:10:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:10:54,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:54,490 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] [2018-11-28 12:10:54,491 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:54,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash 299199095, now seen corresponding path program 2 times [2018-11-28 12:10:54,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:54,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:54,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:54,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:54,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:54,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:54,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 12:10:54,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:10:54,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:10:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:10:54,986 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 17 states. [2018-11-28 12:10:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:56,057 INFO L93 Difference]: Finished difference Result 49993 states and 209684 transitions. [2018-11-28 12:10:56,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 12:10:56,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-28 12:10:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:56,155 INFO L225 Difference]: With dead ends: 49993 [2018-11-28 12:10:56,155 INFO L226 Difference]: Without dead ends: 49687 [2018-11-28 12:10:56,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 12:10:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49687 states. [2018-11-28 12:10:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49687 to 38645. [2018-11-28 12:10:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2018-11-28 12:10:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2018-11-28 12:10:56,814 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2018-11-28 12:10:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:56,814 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2018-11-28 12:10:56,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:10:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2018-11-28 12:10:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:10:56,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:56,832 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] [2018-11-28 12:10:56,832 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:56,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1385009275, now seen corresponding path program 1 times [2018-11-28 12:10:56,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:56,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:56,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:57,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:57,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 12:10:57,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:10:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:10:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:10:57,256 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 19 states. [2018-11-28 12:10:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:58,303 INFO L93 Difference]: Finished difference Result 48949 states and 208196 transitions. [2018-11-28 12:10:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 12:10:58,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-11-28 12:10:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:58,412 INFO L225 Difference]: With dead ends: 48949 [2018-11-28 12:10:58,412 INFO L226 Difference]: Without dead ends: 48703 [2018-11-28 12:10:58,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-28 12:10:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48703 states. [2018-11-28 12:10:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48703 to 38308. [2018-11-28 12:10:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38308 states. [2018-11-28 12:10:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38308 states to 38308 states and 162641 transitions. [2018-11-28 12:10:59,098 INFO L78 Accepts]: Start accepts. Automaton has 38308 states and 162641 transitions. Word has length 46 [2018-11-28 12:10:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:10:59,098 INFO L480 AbstractCegarLoop]: Abstraction has 38308 states and 162641 transitions. [2018-11-28 12:10:59,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:10:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 38308 states and 162641 transitions. [2018-11-28 12:10:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:10:59,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:10:59,110 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] [2018-11-28 12:10:59,110 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:10:59,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash 620423234, now seen corresponding path program 2 times [2018-11-28 12:10:59,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:59,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:59,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:59,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:59,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:10:59,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:10:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:10:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:10:59,232 INFO L87 Difference]: Start difference. First operand 38308 states and 162641 transitions. Second operand 12 states. [2018-11-28 12:10:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:59,615 INFO L93 Difference]: Finished difference Result 52333 states and 220932 transitions. [2018-11-28 12:10:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:10:59,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-28 12:10:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:10:59,716 INFO L225 Difference]: With dead ends: 52333 [2018-11-28 12:10:59,716 INFO L226 Difference]: Without dead ends: 52027 [2018-11-28 12:10:59,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:10:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2018-11-28 12:11:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 38150. [2018-11-28 12:11:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38150 states. [2018-11-28 12:11:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38150 states to 38150 states and 162226 transitions. [2018-11-28 12:11:00,388 INFO L78 Accepts]: Start accepts. Automaton has 38150 states and 162226 transitions. Word has length 46 [2018-11-28 12:11:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:00,388 INFO L480 AbstractCegarLoop]: Abstraction has 38150 states and 162226 transitions. [2018-11-28 12:11:00,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:11:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 38150 states and 162226 transitions. [2018-11-28 12:11:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:11:00,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:00,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:00,407 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:00,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2011508605, now seen corresponding path program 1 times [2018-11-28 12:11:00,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:00,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:00,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:00,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 12:11:00,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:11:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:11:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:11:00,828 INFO L87 Difference]: Start difference. First operand 38150 states and 162226 transitions. Second operand 19 states. [2018-11-28 12:11:01,183 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-11-28 12:11:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:01,825 INFO L93 Difference]: Finished difference Result 46294 states and 195371 transitions. [2018-11-28 12:11:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:11:01,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-28 12:11:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:01,914 INFO L225 Difference]: With dead ends: 46294 [2018-11-28 12:11:01,914 INFO L226 Difference]: Without dead ends: 45988 [2018-11-28 12:11:01,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-11-28 12:11:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45988 states. [2018-11-28 12:11:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45988 to 36584. [2018-11-28 12:11:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36584 states. [2018-11-28 12:11:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36584 states to 36584 states and 155048 transitions. [2018-11-28 12:11:02,514 INFO L78 Accepts]: Start accepts. Automaton has 36584 states and 155048 transitions. Word has length 48 [2018-11-28 12:11:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:02,514 INFO L480 AbstractCegarLoop]: Abstraction has 36584 states and 155048 transitions. [2018-11-28 12:11:02,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:11:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 36584 states and 155048 transitions. [2018-11-28 12:11:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:11:02,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:02,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:02,538 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:02,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1488816992, now seen corresponding path program 1 times [2018-11-28 12:11:02,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:02,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:02,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:03,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:03,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 12:11:03,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:11:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:11:03,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:11:03,050 INFO L87 Difference]: Start difference. First operand 36584 states and 155048 transitions. Second operand 19 states. [2018-11-28 12:11:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:04,693 INFO L93 Difference]: Finished difference Result 42873 states and 179744 transitions. [2018-11-28 12:11:04,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:11:04,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-28 12:11:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:04,767 INFO L225 Difference]: With dead ends: 42873 [2018-11-28 12:11:04,767 INFO L226 Difference]: Without dead ends: 42567 [2018-11-28 12:11:04,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 12:11:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42567 states. [2018-11-28 12:11:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42567 to 34160. [2018-11-28 12:11:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2018-11-28 12:11:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2018-11-28 12:11:05,302 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2018-11-28 12:11:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:05,303 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2018-11-28 12:11:05,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:11:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2018-11-28 12:11:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:05,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:05,319 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] [2018-11-28 12:11:05,319 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:05,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1891753118, now seen corresponding path program 1 times [2018-11-28 12:11:05,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:05,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:05,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:05,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:11:05,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:11:05,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:11:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:11:05,344 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 5 states. [2018-11-28 12:11:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:05,523 INFO L93 Difference]: Finished difference Result 38901 states and 161890 transitions. [2018-11-28 12:11:05,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:11:05,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-28 12:11:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:05,591 INFO L225 Difference]: With dead ends: 38901 [2018-11-28 12:11:05,591 INFO L226 Difference]: Without dead ends: 38067 [2018-11-28 12:11:05,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:11:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38067 states. [2018-11-28 12:11:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38067 to 36249. [2018-11-28 12:11:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36249 states. [2018-11-28 12:11:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36249 states to 36249 states and 152432 transitions. [2018-11-28 12:11:06,125 INFO L78 Accepts]: Start accepts. Automaton has 36249 states and 152432 transitions. Word has length 49 [2018-11-28 12:11:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:06,126 INFO L480 AbstractCegarLoop]: Abstraction has 36249 states and 152432 transitions. [2018-11-28 12:11:06,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:11:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 36249 states and 152432 transitions. [2018-11-28 12:11:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:06,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:06,142 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] [2018-11-28 12:11:06,142 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:06,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1732785392, now seen corresponding path program 2 times [2018-11-28 12:11:06,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:06,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:06,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:06,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:06,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:06,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:06,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:11:06,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:11:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:11:06,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:11:06,210 INFO L87 Difference]: Start difference. First operand 36249 states and 152432 transitions. Second operand 7 states. [2018-11-28 12:11:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:06,507 INFO L93 Difference]: Finished difference Result 40969 states and 170278 transitions. [2018-11-28 12:11:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:11:06,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-28 12:11:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:06,578 INFO L225 Difference]: With dead ends: 40969 [2018-11-28 12:11:06,578 INFO L226 Difference]: Without dead ends: 40135 [2018-11-28 12:11:06,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:11:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40135 states. [2018-11-28 12:11:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40135 to 36228. [2018-11-28 12:11:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2018-11-28 12:11:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2018-11-28 12:11:07,125 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2018-11-28 12:11:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:07,125 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2018-11-28 12:11:07,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:11:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2018-11-28 12:11:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:07,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:07,141 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] [2018-11-28 12:11:07,142 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:07,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1459685517, now seen corresponding path program 1 times [2018-11-28 12:11:07,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:07,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:07,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:07,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:11:07,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:11:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:11:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:11:07,310 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 14 states. [2018-11-28 12:11:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:07,829 INFO L93 Difference]: Finished difference Result 55817 states and 227535 transitions. [2018-11-28 12:11:07,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:11:07,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-11-28 12:11:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:07,902 INFO L225 Difference]: With dead ends: 55817 [2018-11-28 12:11:07,902 INFO L226 Difference]: Without dead ends: 41649 [2018-11-28 12:11:07,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:11:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41649 states. [2018-11-28 12:11:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41649 to 31649. [2018-11-28 12:11:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31649 states. [2018-11-28 12:11:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 132071 transitions. [2018-11-28 12:11:08,428 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 132071 transitions. Word has length 49 [2018-11-28 12:11:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:08,428 INFO L480 AbstractCegarLoop]: Abstraction has 31649 states and 132071 transitions. [2018-11-28 12:11:08,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:11:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 132071 transitions. [2018-11-28 12:11:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:08,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:08,443 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] [2018-11-28 12:11:08,443 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:08,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash -114085722, now seen corresponding path program 1 times [2018-11-28 12:11:08,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:08,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:09,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:09,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:09,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:09,105 INFO L87 Difference]: Start difference. First operand 31649 states and 132071 transitions. Second operand 21 states. [2018-11-28 12:11:09,535 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2018-11-28 12:11:09,665 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-11-28 12:11:10,277 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2018-11-28 12:11:10,408 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2018-11-28 12:11:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:12,262 INFO L93 Difference]: Finished difference Result 55168 states and 228464 transitions. [2018-11-28 12:11:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 12:11:12,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-28 12:11:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:12,363 INFO L225 Difference]: With dead ends: 55168 [2018-11-28 12:11:12,364 INFO L226 Difference]: Without dead ends: 54346 [2018-11-28 12:11:12,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 12:11:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54346 states. [2018-11-28 12:11:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54346 to 35364. [2018-11-28 12:11:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-11-28 12:11:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-11-28 12:11:12,986 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-11-28 12:11:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:12,986 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-11-28 12:11:12,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-11-28 12:11:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:13,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:13,004 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] [2018-11-28 12:11:13,004 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:13,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:13,005 INFO L82 PathProgramCache]: Analyzing trace with hash -672953966, now seen corresponding path program 3 times [2018-11-28 12:11:13,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:13,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:13,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:13,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:13,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:13,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:13,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 12:11:13,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 12:11:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:11:13,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:11:13,244 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 16 states. [2018-11-28 12:11:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:13,611 INFO L93 Difference]: Finished difference Result 39597 states and 166907 transitions. [2018-11-28 12:11:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:11:13,611 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-28 12:11:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:13,681 INFO L225 Difference]: With dead ends: 39597 [2018-11-28 12:11:13,681 INFO L226 Difference]: Without dead ends: 38958 [2018-11-28 12:11:13,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:11:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38958 states. [2018-11-28 12:11:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38958 to 35364. [2018-11-28 12:11:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-11-28 12:11:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-11-28 12:11:14,204 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-11-28 12:11:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:14,204 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-11-28 12:11:14,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 12:11:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-11-28 12:11:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:14,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:14,222 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] [2018-11-28 12:11:14,222 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:14,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1155264282, now seen corresponding path program 4 times [2018-11-28 12:11:14,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:14,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:14,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:14,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:14,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 12:11:14,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:11:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:11:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:11:14,632 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 19 states. [2018-11-28 12:11:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:15,380 INFO L93 Difference]: Finished difference Result 41619 states and 175078 transitions. [2018-11-28 12:11:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 12:11:15,380 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-28 12:11:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:15,454 INFO L225 Difference]: With dead ends: 41619 [2018-11-28 12:11:15,455 INFO L226 Difference]: Without dead ends: 40980 [2018-11-28 12:11:15,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-11-28 12:11:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40980 states. [2018-11-28 12:11:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40980 to 35412. [2018-11-28 12:11:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35412 states. [2018-11-28 12:11:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35412 states to 35412 states and 150956 transitions. [2018-11-28 12:11:15,987 INFO L78 Accepts]: Start accepts. Automaton has 35412 states and 150956 transitions. Word has length 49 [2018-11-28 12:11:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:15,987 INFO L480 AbstractCegarLoop]: Abstraction has 35412 states and 150956 transitions. [2018-11-28 12:11:15,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:11:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 35412 states and 150956 transitions. [2018-11-28 12:11:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:11:16,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:16,005 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] [2018-11-28 12:11:16,005 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:16,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1728037470, now seen corresponding path program 5 times [2018-11-28 12:11:16,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:16,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:16,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:16,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 12:11:16,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 12:11:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:11:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:11:16,236 INFO L87 Difference]: Start difference. First operand 35412 states and 150956 transitions. Second operand 16 states. [2018-11-28 12:11:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:16,812 INFO L93 Difference]: Finished difference Result 44552 states and 186042 transitions. [2018-11-28 12:11:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 12:11:16,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-28 12:11:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:16,886 INFO L225 Difference]: With dead ends: 44552 [2018-11-28 12:11:16,886 INFO L226 Difference]: Without dead ends: 43913 [2018-11-28 12:11:16,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:11:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43913 states. [2018-11-28 12:11:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43913 to 34825. [2018-11-28 12:11:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34825 states. [2018-11-28 12:11:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 148359 transitions. [2018-11-28 12:11:17,417 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 148359 transitions. Word has length 49 [2018-11-28 12:11:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:17,417 INFO L480 AbstractCegarLoop]: Abstraction has 34825 states and 148359 transitions. [2018-11-28 12:11:17,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 12:11:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 148359 transitions. [2018-11-28 12:11:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:17,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:17,438 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] [2018-11-28 12:11:17,438 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:17,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash 568200004, now seen corresponding path program 1 times [2018-11-28 12:11:17,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:17,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:17,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:18,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:18,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:18,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:18,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:18,108 INFO L87 Difference]: Start difference. First operand 34825 states and 148359 transitions. Second operand 21 states. [2018-11-28 12:11:18,558 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-11-28 12:11:18,702 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-11-28 12:11:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:20,028 INFO L93 Difference]: Finished difference Result 36224 states and 150699 transitions. [2018-11-28 12:11:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 12:11:20,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-11-28 12:11:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:20,089 INFO L225 Difference]: With dead ends: 36224 [2018-11-28 12:11:20,089 INFO L226 Difference]: Without dead ends: 35180 [2018-11-28 12:11:20,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 12:11:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35180 states. [2018-11-28 12:11:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35180 to 29756. [2018-11-28 12:11:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2018-11-28 12:11:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 124486 transitions. [2018-11-28 12:11:20,542 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 124486 transitions. Word has length 51 [2018-11-28 12:11:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:20,542 INFO L480 AbstractCegarLoop]: Abstraction has 29756 states and 124486 transitions. [2018-11-28 12:11:20,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 124486 transitions. [2018-11-28 12:11:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:20,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:20,561 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] [2018-11-28 12:11:20,561 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:20,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash 845920999, now seen corresponding path program 1 times [2018-11-28 12:11:20,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:20,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:21,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:21,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:21,086 INFO L87 Difference]: Start difference. First operand 29756 states and 124486 transitions. Second operand 21 states. [2018-11-28 12:11:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:22,373 INFO L93 Difference]: Finished difference Result 37835 states and 157450 transitions. [2018-11-28 12:11:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 12:11:22,373 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-11-28 12:11:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:22,438 INFO L225 Difference]: With dead ends: 37835 [2018-11-28 12:11:22,438 INFO L226 Difference]: Without dead ends: 36917 [2018-11-28 12:11:22,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 12:11:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36917 states. [2018-11-28 12:11:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36917 to 25502. [2018-11-28 12:11:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25502 states. [2018-11-28 12:11:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25502 states to 25502 states and 105052 transitions. [2018-11-28 12:11:22,872 INFO L78 Accepts]: Start accepts. Automaton has 25502 states and 105052 transitions. Word has length 51 [2018-11-28 12:11:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:22,872 INFO L480 AbstractCegarLoop]: Abstraction has 25502 states and 105052 transitions. [2018-11-28 12:11:22,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25502 states and 105052 transitions. [2018-11-28 12:11:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:22,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:22,888 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] [2018-11-28 12:11:22,889 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:22,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 531858785, now seen corresponding path program 2 times [2018-11-28 12:11:22,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:22,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:23,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:23,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:23,630 INFO L87 Difference]: Start difference. First operand 25502 states and 105052 transitions. Second operand 21 states. [2018-11-28 12:11:24,467 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-11-28 12:11:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:25,640 INFO L93 Difference]: Finished difference Result 38880 states and 159223 transitions. [2018-11-28 12:11:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 12:11:25,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-11-28 12:11:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:25,713 INFO L225 Difference]: With dead ends: 38880 [2018-11-28 12:11:25,713 INFO L226 Difference]: Without dead ends: 38574 [2018-11-28 12:11:25,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 12:11:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38574 states. [2018-11-28 12:11:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38574 to 20447. [2018-11-28 12:11:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20447 states. [2018-11-28 12:11:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20447 states to 20447 states and 83415 transitions. [2018-11-28 12:11:26,114 INFO L78 Accepts]: Start accepts. Automaton has 20447 states and 83415 transitions. Word has length 51 [2018-11-28 12:11:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:26,114 INFO L480 AbstractCegarLoop]: Abstraction has 20447 states and 83415 transitions. [2018-11-28 12:11:26,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 20447 states and 83415 transitions. [2018-11-28 12:11:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:26,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:26,128 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] [2018-11-28 12:11:26,128 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:26,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash -604065647, now seen corresponding path program 1 times [2018-11-28 12:11:26,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:26,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:26,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:26,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 12:11:26,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:11:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:11:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:11:26,621 INFO L87 Difference]: Start difference. First operand 20447 states and 83415 transitions. Second operand 19 states. [2018-11-28 12:11:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:27,551 INFO L93 Difference]: Finished difference Result 25964 states and 104818 transitions. [2018-11-28 12:11:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:11:27,551 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-28 12:11:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:27,599 INFO L225 Difference]: With dead ends: 25964 [2018-11-28 12:11:27,599 INFO L226 Difference]: Without dead ends: 25595 [2018-11-28 12:11:27,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2018-11-28 12:11:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25595 states. [2018-11-28 12:11:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25595 to 20399. [2018-11-28 12:11:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2018-11-28 12:11:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2018-11-28 12:11:27,920 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 51 [2018-11-28 12:11:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:27,920 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2018-11-28 12:11:27,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:11:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2018-11-28 12:11:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:27,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:27,934 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] [2018-11-28 12:11:27,934 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:27,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1659149151, now seen corresponding path program 2 times [2018-11-28 12:11:27,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:27,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:27,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:27,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:28,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:28,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 12:11:28,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:11:28,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:11:28,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:11:28,376 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 19 states. [2018-11-28 12:11:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:29,422 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2018-11-28 12:11:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 12:11:29,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-28 12:11:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:29,473 INFO L225 Difference]: With dead ends: 27038 [2018-11-28 12:11:29,473 INFO L226 Difference]: Without dead ends: 26669 [2018-11-28 12:11:29,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 12:11:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2018-11-28 12:11:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2018-11-28 12:11:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-11-28 12:11:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2018-11-28 12:11:29,785 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2018-11-28 12:11:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:29,785 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2018-11-28 12:11:29,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:11:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2018-11-28 12:11:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:29,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:29,798 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] [2018-11-28 12:11:29,798 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:29,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1841104979, now seen corresponding path program 1 times [2018-11-28 12:11:29,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:29,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:29,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:30,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 12:11:30,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 12:11:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 12:11:30,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:11:30,174 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2018-11-28 12:11:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:30,749 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2018-11-28 12:11:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:11:30,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-11-28 12:11:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:30,792 INFO L225 Difference]: With dead ends: 26099 [2018-11-28 12:11:30,792 INFO L226 Difference]: Without dead ends: 25550 [2018-11-28 12:11:30,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-11-28 12:11:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2018-11-28 12:11:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2018-11-28 12:11:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2018-11-28 12:11:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2018-11-28 12:11:31,108 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2018-11-28 12:11:31,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:31,108 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2018-11-28 12:11:31,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 12:11:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2018-11-28 12:11:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:11:31,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:31,121 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] [2018-11-28 12:11:31,121 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:31,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:31,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1358794663, now seen corresponding path program 2 times [2018-11-28 12:11:31,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:31,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:31,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:31,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:31,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:31,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:31,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:31,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:31,680 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2018-11-28 12:11:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:33,174 INFO L93 Difference]: Finished difference Result 24529 states and 99196 transitions. [2018-11-28 12:11:33,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 12:11:33,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-11-28 12:11:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:33,209 INFO L225 Difference]: With dead ends: 24529 [2018-11-28 12:11:33,209 INFO L226 Difference]: Without dead ends: 22702 [2018-11-28 12:11:33,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=382, Invalid=1340, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 12:11:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2018-11-28 12:11:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 17110. [2018-11-28 12:11:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2018-11-28 12:11:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 69704 transitions. [2018-11-28 12:11:33,465 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 69704 transitions. Word has length 51 [2018-11-28 12:11:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:33,465 INFO L480 AbstractCegarLoop]: Abstraction has 17110 states and 69704 transitions. [2018-11-28 12:11:33,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 69704 transitions. [2018-11-28 12:11:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:11:33,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:33,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:33,476 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:33,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash 66214973, now seen corresponding path program 1 times [2018-11-28 12:11:33,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:33,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:33,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:33,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:33,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:11:33,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:11:33,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:11:33,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:11:33,513 INFO L87 Difference]: Start difference. First operand 17110 states and 69704 transitions. Second operand 5 states. [2018-11-28 12:11:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:33,632 INFO L93 Difference]: Finished difference Result 20123 states and 80035 transitions. [2018-11-28 12:11:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:11:33,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 12:11:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:33,667 INFO L225 Difference]: With dead ends: 20123 [2018-11-28 12:11:33,667 INFO L226 Difference]: Without dead ends: 19403 [2018-11-28 12:11:33,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:11:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19403 states. [2018-11-28 12:11:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19403 to 18983. [2018-11-28 12:11:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18983 states. [2018-11-28 12:11:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18983 states to 18983 states and 76438 transitions. [2018-11-28 12:11:33,933 INFO L78 Accepts]: Start accepts. Automaton has 18983 states and 76438 transitions. Word has length 52 [2018-11-28 12:11:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:33,933 INFO L480 AbstractCegarLoop]: Abstraction has 18983 states and 76438 transitions. [2018-11-28 12:11:33,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:11:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 18983 states and 76438 transitions. [2018-11-28 12:11:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:11:33,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:33,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:33,948 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:33,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:33,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1212252299, now seen corresponding path program 2 times [2018-11-28 12:11:33,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:33,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:33,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:33,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:11:33,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:11:33,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:11:33,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:11:33,988 INFO L87 Difference]: Start difference. First operand 18983 states and 76438 transitions. Second operand 7 states. [2018-11-28 12:11:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:34,187 INFO L93 Difference]: Finished difference Result 21975 states and 86737 transitions. [2018-11-28 12:11:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:11:34,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 12:11:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:34,223 INFO L225 Difference]: With dead ends: 21975 [2018-11-28 12:11:34,223 INFO L226 Difference]: Without dead ends: 21255 [2018-11-28 12:11:34,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:11:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21255 states. [2018-11-28 12:11:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21255 to 18962. [2018-11-28 12:11:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18962 states. [2018-11-28 12:11:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18962 states to 18962 states and 76406 transitions. [2018-11-28 12:11:34,500 INFO L78 Accepts]: Start accepts. Automaton has 18962 states and 76406 transitions. Word has length 52 [2018-11-28 12:11:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:34,500 INFO L480 AbstractCegarLoop]: Abstraction has 18962 states and 76406 transitions. [2018-11-28 12:11:34,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:11:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18962 states and 76406 transitions. [2018-11-28 12:11:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:11:34,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:34,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:34,515 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:34,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash -602885373, now seen corresponding path program 3 times [2018-11-28 12:11:34,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:34,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:34,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:34,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:34,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:35,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:35,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:35,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:35,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:35,047 INFO L87 Difference]: Start difference. First operand 18962 states and 76406 transitions. Second operand 21 states. [2018-11-28 12:11:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:36,341 INFO L93 Difference]: Finished difference Result 24590 states and 97599 transitions. [2018-11-28 12:11:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 12:11:36,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-11-28 12:11:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:36,376 INFO L225 Difference]: With dead ends: 24590 [2018-11-28 12:11:36,376 INFO L226 Difference]: Without dead ends: 22430 [2018-11-28 12:11:36,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 12:11:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2018-11-28 12:11:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 18290. [2018-11-28 12:11:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2018-11-28 12:11:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 73678 transitions. [2018-11-28 12:11:36,645 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 73678 transitions. Word has length 52 [2018-11-28 12:11:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:36,645 INFO L480 AbstractCegarLoop]: Abstraction has 18290 states and 73678 transitions. [2018-11-28 12:11:36,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 73678 transitions. [2018-11-28 12:11:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:11:36,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:36,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:36,658 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:36,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -645490969, now seen corresponding path program 4 times [2018-11-28 12:11:36,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:36,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:36,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:36,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:36,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:36,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:36,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 12:11:36,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 12:11:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 12:11:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:11:36,981 INFO L87 Difference]: Start difference. First operand 18290 states and 73678 transitions. Second operand 18 states. [2018-11-28 12:11:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:37,408 INFO L93 Difference]: Finished difference Result 24227 states and 94267 transitions. [2018-11-28 12:11:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:11:37,409 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-11-28 12:11:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:37,446 INFO L225 Difference]: With dead ends: 24227 [2018-11-28 12:11:37,446 INFO L226 Difference]: Without dead ends: 23507 [2018-11-28 12:11:37,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-11-28 12:11:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2018-11-28 12:11:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 17551. [2018-11-28 12:11:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17551 states. [2018-11-28 12:11:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17551 states to 17551 states and 70727 transitions. [2018-11-28 12:11:37,712 INFO L78 Accepts]: Start accepts. Automaton has 17551 states and 70727 transitions. Word has length 52 [2018-11-28 12:11:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:37,712 INFO L480 AbstractCegarLoop]: Abstraction has 17551 states and 70727 transitions. [2018-11-28 12:11:37,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 12:11:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17551 states and 70727 transitions. [2018-11-28 12:11:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 12:11:37,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:37,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:37,727 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash -676697198, now seen corresponding path program 1 times [2018-11-28 12:11:37,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:37,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:38,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:38,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:38,565 INFO L87 Difference]: Start difference. First operand 17551 states and 70727 transitions. Second operand 21 states. [2018-11-28 12:11:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:40,682 INFO L93 Difference]: Finished difference Result 25327 states and 100129 transitions. [2018-11-28 12:11:40,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 12:11:40,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-11-28 12:11:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:40,724 INFO L225 Difference]: With dead ends: 25327 [2018-11-28 12:11:40,724 INFO L226 Difference]: Without dead ends: 25012 [2018-11-28 12:11:40,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 12:11:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25012 states. [2018-11-28 12:11:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25012 to 13402. [2018-11-28 12:11:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2018-11-28 12:11:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 53709 transitions. [2018-11-28 12:11:40,977 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 53709 transitions. Word has length 53 [2018-11-28 12:11:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:40,978 INFO L480 AbstractCegarLoop]: Abstraction has 13402 states and 53709 transitions. [2018-11-28 12:11:40,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 53709 transitions. [2018-11-28 12:11:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:11:40,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:40,990 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] [2018-11-28 12:11:40,991 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:40,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1294667716, now seen corresponding path program 1 times [2018-11-28 12:11:40,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:40,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:41,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:41,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:41,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:41,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:41,637 INFO L87 Difference]: Start difference. First operand 13402 states and 53709 transitions. Second operand 21 states. [2018-11-28 12:11:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:42,848 INFO L93 Difference]: Finished difference Result 22774 states and 89010 transitions. [2018-11-28 12:11:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 12:11:42,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-11-28 12:11:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:42,884 INFO L225 Difference]: With dead ends: 22774 [2018-11-28 12:11:42,884 INFO L226 Difference]: Without dead ends: 22198 [2018-11-28 12:11:42,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:11:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2018-11-28 12:11:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 12634. [2018-11-28 12:11:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2018-11-28 12:11:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2018-11-28 12:11:43,106 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 54 [2018-11-28 12:11:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:43,107 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2018-11-28 12:11:43,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2018-11-28 12:11:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:11:43,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:43,117 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] [2018-11-28 12:11:43,117 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:43,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:43,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1387947128, now seen corresponding path program 2 times [2018-11-28 12:11:43,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:43,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:43,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:43,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:43,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 12:11:43,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:11:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:11:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:11:43,863 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 21 states. [2018-11-28 12:11:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:45,267 INFO L93 Difference]: Finished difference Result 12034 states and 46239 transitions. [2018-11-28 12:11:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 12:11:45,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-11-28 12:11:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:45,284 INFO L225 Difference]: With dead ends: 12034 [2018-11-28 12:11:45,284 INFO L226 Difference]: Without dead ends: 11458 [2018-11-28 12:11:45,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 12:11:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2018-11-28 12:11:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6913. [2018-11-28 12:11:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2018-11-28 12:11:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2018-11-28 12:11:45,401 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2018-11-28 12:11:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:45,401 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2018-11-28 12:11:45,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:11:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2018-11-28 12:11:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 12:11:45,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:45,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:45,410 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 831472606, now seen corresponding path program 1 times [2018-11-28 12:11:45,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:45,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:45,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:11:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:45,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:45,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:11:45,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:11:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:11:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:11:45,496 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 8 states. [2018-11-28 12:11:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:45,620 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2018-11-28 12:11:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:11:45,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-28 12:11:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:45,632 INFO L225 Difference]: With dead ends: 6913 [2018-11-28 12:11:45,632 INFO L226 Difference]: Without dead ends: 6868 [2018-11-28 12:11:45,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:11:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2018-11-28 12:11:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2018-11-28 12:11:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2018-11-28 12:11:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2018-11-28 12:11:45,722 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2018-11-28 12:11:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:45,722 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2018-11-28 12:11:45,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:11:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2018-11-28 12:11:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 12:11:45,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:45,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:45,730 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:45,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 531803949, now seen corresponding path program 1 times [2018-11-28 12:11:45,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:45,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:45,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:45,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:11:45,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:11:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:11:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:11:45,786 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2018-11-28 12:11:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:45,901 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2018-11-28 12:11:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:11:45,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-11-28 12:11:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:45,912 INFO L225 Difference]: With dead ends: 6868 [2018-11-28 12:11:45,912 INFO L226 Difference]: Without dead ends: 6670 [2018-11-28 12:11:45,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:11:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2018-11-28 12:11:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2018-11-28 12:11:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2018-11-28 12:11:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2018-11-28 12:11:46,001 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2018-11-28 12:11:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:46,001 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2018-11-28 12:11:46,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:11:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2018-11-28 12:11:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 12:11:46,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:46,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:46,010 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:46,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash -293321056, now seen corresponding path program 1 times [2018-11-28 12:11:46,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:46,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:46,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:46,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:46,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:11:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:11:46,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:11:46,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:11:46,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:11:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:11:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:11:46,164 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 11 states. [2018-11-28 12:11:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:11:46,508 INFO L93 Difference]: Finished difference Result 7357 states and 29738 transitions. [2018-11-28 12:11:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:11:46,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-11-28 12:11:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:11:46,519 INFO L225 Difference]: With dead ends: 7357 [2018-11-28 12:11:46,519 INFO L226 Difference]: Without dead ends: 7357 [2018-11-28 12:11:46,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:11:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7357 states. [2018-11-28 12:11:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7357 to 7273. [2018-11-28 12:11:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2018-11-28 12:11:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 29478 transitions. [2018-11-28 12:11:46,607 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 29478 transitions. Word has length 87 [2018-11-28 12:11:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:11:46,607 INFO L480 AbstractCegarLoop]: Abstraction has 7273 states and 29478 transitions. [2018-11-28 12:11:46,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:11:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 29478 transitions. [2018-11-28 12:11:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 12:11:46,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:11:46,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:11:46,617 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:11:46,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:11:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1360449134, now seen corresponding path program 1 times [2018-11-28 12:11:46,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:11:46,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:11:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:46,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:11:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:11:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:11:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:11:46,656 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:11:46,736 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 12:11:46,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:11:46 BasicIcfg [2018-11-28 12:11:46,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:11:46,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:11:46,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:11:46,739 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:11:46,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:29" (3/4) ... [2018-11-28 12:11:46,744 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 12:11:46,810 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d8d8684-584a-49a9-8906-4d694e62bdc9/bin-2019/uautomizer/witness.graphml [2018-11-28 12:11:46,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:11:46,811 INFO L168 Benchmark]: Toolchain (without parser) took 78224.50 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -477.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-11-28 12:11:46,812 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:11:46,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -85.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:11:46,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.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-11-28 12:11:46,813 INFO L168 Benchmark]: Boogie Preprocessor took 20.22 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:11:46,813 INFO L168 Benchmark]: RCFGBuilder took 335.76 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:11:46,813 INFO L168 Benchmark]: TraceAbstraction took 77277.02 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -494.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-28 12:11:46,813 INFO L168 Benchmark]: Witness Printer took 72.18 ms. Allocated memory is still 4.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:11:46,819 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -85.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.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. * Boogie Preprocessor took 20.22 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.76 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77277.02 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -494.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 72.18 ms. Allocated memory is still 4.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1212]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1213] -1 char *v; VAL [v={0:0}] [L1246] -1 pthread_t t; VAL [v={0:0}] [L1247] FCALL, FORK -1 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={95:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={0:0}] [L1248] -1 \read(t) VAL [arg={0:0}, arg={0:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={0:0}] [L1232] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={0:0}] [L1216] 1 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1217] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1233] 0 \read(t1) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1233] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1234] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1221] 2 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1235] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1222] 2 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1236] FCALL, FORK 0 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1237] FCALL, FORK 0 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1221] 4 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1222] 4 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1238] 0 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1238] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1239] 0 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1221] 5 v[0] = 'X' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1222] 5 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1226] 3 v[0] = 'Y' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1227] 3 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1239] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1240] 0 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1240] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1241] 0 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1241] FCALL, JOIN 4 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1248] FCALL, JOIN 0 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1249] -1 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1212] COND TRUE -1 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1212] -1 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 1 error locations. UNSAFE Result, 77.0s OverallTime, 44 OverallIterations, 1 TraceHistogramMax, 38.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8382 SDtfs, 22294 SDslu, 49653 SDs, 0 SdLazy, 22960 SolverSat, 2927 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1190 GetRequests, 157 SyntacticMatches, 44 SemanticMatches, 989 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5881 ImplicationChecksByTransitivity, 27.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47312occurred 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: 21.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 307283 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 2226 NumberOfCodeBlocks, 2226 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2096 ConstructedInterpolants, 0 QuantifiedInterpolants, 1796515 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...