./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/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-635dfa2 [2018-12-02 05:37:26,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:37:26,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:37:26,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:37:26,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:37:26,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:37:26,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:37:26,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:37:26,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:37:26,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:37:26,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:37:26,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:37:26,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:37:26,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:37:26,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:37:26,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:37:26,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:37:26,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:37:26,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:37:26,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:37:26,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:37:26,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:37:26,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:37:26,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:37:26,130 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:37:26,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:37:26,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:37:26,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:37:26,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:37:26,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:37:26,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:37:26,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:37:26,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:37:26,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:37:26,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:37:26,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:37:26,134 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 05:37:26,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:37:26,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:37:26,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:37:26,141 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:37:26,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:37:26,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:37:26,142 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:37:26,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:37:26,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:37:26,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:37:26,144 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_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/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-12-02 05:37:26,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:37:26,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:37:26,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:37:26,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:37:26,169 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:37:26,170 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-02 05:37:26,203 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/data/be070832a/57e74497eae944cdb0f8bae71d7f6de7/FLAG86ab5d19f [2018-12-02 05:37:26,620 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:37:26,621 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-02 05:37:26,629 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/data/be070832a/57e74497eae944cdb0f8bae71d7f6de7/FLAG86ab5d19f [2018-12-02 05:37:26,637 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/data/be070832a/57e74497eae944cdb0f8bae71d7f6de7 [2018-12-02 05:37:26,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:37:26,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:37:26,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:37:26,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:37:26,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:37:26,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:26" (1/1) ... [2018-12-02 05:37:26,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6f768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:26, skipping insertion in model container [2018-12-02 05:37:26,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:26" (1/1) ... [2018-12-02 05:37:26,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:37:26,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:37:26,900 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:37:26,906 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:37:26,975 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:37:27,042 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:37:27,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27 WrapperNode [2018-12-02 05:37:27,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:37:27,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:37:27,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:37:27,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:37:27,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:37:27,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:37:27,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:37:27,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:37:27,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... [2018-12-02 05:37:27,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:37:27,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:37:27,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:37:27,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:37:27,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-02 05:37:27,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-02 05:37:27,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-02 05:37:27,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-02 05:37:27,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-02 05:37:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:37:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:37:27,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:37:27,120 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 05:37:27,287 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:37:27,287 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 05:37:27,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:27 BoogieIcfgContainer [2018-12-02 05:37:27,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:37:27,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:37:27,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:37:27,290 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:37:27,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:37:26" (1/3) ... [2018-12-02 05:37:27,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37296342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:27, skipping insertion in model container [2018-12-02 05:37:27,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:27" (2/3) ... [2018-12-02 05:37:27,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37296342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:27, skipping insertion in model container [2018-12-02 05:37:27,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:27" (3/3) ... [2018-12-02 05:37:27,292 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2018-12-02 05:37:27,318 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,318 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,318 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,319 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,330 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,331 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,331 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,331 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,331 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,331 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,331 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,332 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,332 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,332 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,332 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,333 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,333 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,333 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,333 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,334 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,334 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,334 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:37:27,428 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 05:37:27,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:37:27,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:37:27,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:37:27,457 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:37:27,458 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:37:27,458 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:37:27,458 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:37:27,458 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:37:27,458 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:37:27,459 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:37:27,459 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:37:27,459 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:37:27,469 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2018-12-02 05:37:29,400 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2018-12-02 05:37:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2018-12-02 05:37:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 05:37:29,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:29,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:37:29,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 537396033, now seen corresponding path program 1 times [2018-12-02 05:37:29,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:29,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:29,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:29,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:37:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:37:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:37:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:37:29,691 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 10 states. [2018-12-02 05:37:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:30,392 INFO L93 Difference]: Finished difference Result 53969 states and 232570 transitions. [2018-12-02 05:37:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:37:30,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-02 05:37:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:30,536 INFO L225 Difference]: With dead ends: 53969 [2018-12-02 05:37:30,537 INFO L226 Difference]: Without dead ends: 38044 [2018-12-02 05:37:30,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:37:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38044 states. [2018-12-02 05:37:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38044 to 31405. [2018-12-02 05:37:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31405 states. [2018-12-02 05:37:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31405 states to 31405 states and 135819 transitions. [2018-12-02 05:37:31,409 INFO L78 Accepts]: Start accepts. Automaton has 31405 states and 135819 transitions. Word has length 31 [2018-12-02 05:37:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:31,409 INFO L480 AbstractCegarLoop]: Abstraction has 31405 states and 135819 transitions. [2018-12-02 05:37:31,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:37:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31405 states and 135819 transitions. [2018-12-02 05:37:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 05:37:31,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:31,410 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-12-02 05:37:31,411 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:31,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash -756897297, now seen corresponding path program 2 times [2018-12-02 05:37:31,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:31,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:31,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:31,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:31,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:37:31,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:37:31,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:37:31,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:37:31,516 INFO L87 Difference]: Start difference. First operand 31405 states and 135819 transitions. Second operand 10 states. [2018-12-02 05:37:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:31,911 INFO L93 Difference]: Finished difference Result 44657 states and 198278 transitions. [2018-12-02 05:37:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:37:31,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-02 05:37:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:32,018 INFO L225 Difference]: With dead ends: 44657 [2018-12-02 05:37:32,018 INFO L226 Difference]: Without dead ends: 44657 [2018-12-02 05:37:32,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:37:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2018-12-02 05:37:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 31363. [2018-12-02 05:37:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2018-12-02 05:37:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2018-12-02 05:37:32,681 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2018-12-02 05:37:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:32,681 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2018-12-02 05:37:32,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:37:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2018-12-02 05:37:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 05:37:32,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:32,685 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-12-02 05:37:32,685 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:32,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 825642035, now seen corresponding path program 1 times [2018-12-02 05:37:32,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:32,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:32,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:32,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:37:32,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:37:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:37:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:37:32,732 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 6 states. [2018-12-02 05:37:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:33,094 INFO L93 Difference]: Finished difference Result 67819 states and 285625 transitions. [2018-12-02 05:37:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:37:33,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-02 05:37:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:33,304 INFO L225 Difference]: With dead ends: 67819 [2018-12-02 05:37:33,304 INFO L226 Difference]: Without dead ends: 41885 [2018-12-02 05:37:33,304 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-12-02 05:37:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41885 states. [2018-12-02 05:37:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41885 to 32363. [2018-12-02 05:37:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32363 states. [2018-12-02 05:37:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32363 states to 32363 states and 134937 transitions. [2018-12-02 05:37:33,826 INFO L78 Accepts]: Start accepts. Automaton has 32363 states and 134937 transitions. Word has length 41 [2018-12-02 05:37:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:33,826 INFO L480 AbstractCegarLoop]: Abstraction has 32363 states and 134937 transitions. [2018-12-02 05:37:33,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:37:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 32363 states and 134937 transitions. [2018-12-02 05:37:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 05:37:33,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:33,833 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-12-02 05:37:33,833 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:33,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1767070092, now seen corresponding path program 1 times [2018-12-02 05:37:33,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:33,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:33,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:37:33,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:37:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:37:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:37:33,921 INFO L87 Difference]: Start difference. First operand 32363 states and 134937 transitions. Second operand 7 states. [2018-12-02 05:37:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:34,206 INFO L93 Difference]: Finished difference Result 39181 states and 163715 transitions. [2018-12-02 05:37:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:37:34,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-02 05:37:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:34,368 INFO L225 Difference]: With dead ends: 39181 [2018-12-02 05:37:34,368 INFO L226 Difference]: Without dead ends: 39109 [2018-12-02 05:37:34,368 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-12-02 05:37:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39109 states. [2018-12-02 05:37:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39109 to 35466. [2018-12-02 05:37:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2018-12-02 05:37:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2018-12-02 05:37:34,898 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2018-12-02 05:37:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:34,898 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2018-12-02 05:37:34,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:37:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2018-12-02 05:37:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 05:37:34,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:34,904 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-12-02 05:37:34,904 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:34,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash -638377908, now seen corresponding path program 2 times [2018-12-02 05:37:34,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:34,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:34,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-12-02 05:37:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:34,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:37:34,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:37:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:37:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:37:34,981 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2018-12-02 05:37:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:35,402 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2018-12-02 05:37:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:37:35,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-02 05:37:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:35,480 INFO L225 Difference]: With dead ends: 49948 [2018-12-02 05:37:35,481 INFO L226 Difference]: Without dead ends: 45132 [2018-12-02 05:37:35,481 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-12-02 05:37:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2018-12-02 05:37:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2018-12-02 05:37:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2018-12-02 05:37:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2018-12-02 05:37:36,123 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2018-12-02 05:37:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:36,123 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2018-12-02 05:37:36,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:37:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2018-12-02 05:37:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 05:37:36,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:36,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:37:36,130 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:36,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:36,130 INFO L82 PathProgramCache]: Analyzing trace with hash 703641554, now seen corresponding path program 1 times [2018-12-02 05:37:36,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:36,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:36,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:36,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:36,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:36,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:36,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:37:36,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:37:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:37:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:37:36,183 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 7 states. [2018-12-02 05:37:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:36,452 INFO L93 Difference]: Finished difference Result 38268 states and 158857 transitions. [2018-12-02 05:37:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:37:36,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-02 05:37:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:36,520 INFO L225 Difference]: With dead ends: 38268 [2018-12-02 05:37:36,520 INFO L226 Difference]: Without dead ends: 37788 [2018-12-02 05:37:36,520 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-12-02 05:37:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37788 states. [2018-12-02 05:37:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37788 to 36092. [2018-12-02 05:37:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2018-12-02 05:37:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2018-12-02 05:37:37,200 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2018-12-02 05:37:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:37,201 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2018-12-02 05:37:37,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:37:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2018-12-02 05:37:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 05:37:37,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:37,208 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-12-02 05:37:37,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:37,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash -273083420, now seen corresponding path program 2 times [2018-12-02 05:37:37,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:37,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:37,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 05:37:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:37:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:37:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:37:37,494 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2018-12-02 05:37:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:38,318 INFO L93 Difference]: Finished difference Result 43003 states and 180466 transitions. [2018-12-02 05:37:38,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:37:38,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-02 05:37:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:38,401 INFO L225 Difference]: With dead ends: 43003 [2018-12-02 05:37:38,401 INFO L226 Difference]: Without dead ends: 42757 [2018-12-02 05:37:38,402 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-12-02 05:37:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42757 states. [2018-12-02 05:37:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42757 to 39101. [2018-12-02 05:37:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39101 states. [2018-12-02 05:37:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39101 states to 39101 states and 165551 transitions. [2018-12-02 05:37:39,010 INFO L78 Accepts]: Start accepts. Automaton has 39101 states and 165551 transitions. Word has length 44 [2018-12-02 05:37:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:39,011 INFO L480 AbstractCegarLoop]: Abstraction has 39101 states and 165551 transitions. [2018-12-02 05:37:39,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:37:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 39101 states and 165551 transitions. [2018-12-02 05:37:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 05:37:39,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:39,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:37:39,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:39,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1145868854, now seen corresponding path program 3 times [2018-12-02 05:37:39,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:39,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:39,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:39,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:39,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:37:39,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:37:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:37:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:37:39,206 INFO L87 Difference]: Start difference. First operand 39101 states and 165551 transitions. Second operand 14 states. [2018-12-02 05:37:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:39,676 INFO L93 Difference]: Finished difference Result 52387 states and 222062 transitions. [2018-12-02 05:37:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:37:39,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-12-02 05:37:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:39,789 INFO L225 Difference]: With dead ends: 52387 [2018-12-02 05:37:39,789 INFO L226 Difference]: Without dead ends: 52141 [2018-12-02 05:37:39,789 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-12-02 05:37:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52141 states. [2018-12-02 05:37:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52141 to 39028. [2018-12-02 05:37:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2018-12-02 05:37:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2018-12-02 05:37:40,515 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 44 [2018-12-02 05:37:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:40,515 INFO L480 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2018-12-02 05:37:40,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:37:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2018-12-02 05:37:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:40,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:40,528 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-12-02 05:37:40,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:40,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -924841218, now seen corresponding path program 1 times [2018-12-02 05:37:40,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:40,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:40,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-02 05:37:40,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 05:37:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 05:37:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:37:40,993 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 20 states. [2018-12-02 05:37:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:43,250 INFO L93 Difference]: Finished difference Result 54953 states and 225523 transitions. [2018-12-02 05:37:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 05:37:43,250 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-12-02 05:37:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:43,450 INFO L225 Difference]: With dead ends: 54953 [2018-12-02 05:37:43,450 INFO L226 Difference]: Without dead ends: 50049 [2018-12-02 05:37:43,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 05:37:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50049 states. [2018-12-02 05:37:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50049 to 39103. [2018-12-02 05:37:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39103 states. [2018-12-02 05:37:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39103 states to 39103 states and 165629 transitions. [2018-12-02 05:37:44,043 INFO L78 Accepts]: Start accepts. Automaton has 39103 states and 165629 transitions. Word has length 46 [2018-12-02 05:37:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:44,043 INFO L480 AbstractCegarLoop]: Abstraction has 39103 states and 165629 transitions. [2018-12-02 05:37:44,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 05:37:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 39103 states and 165629 transitions. [2018-12-02 05:37:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:44,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:44,056 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-12-02 05:37:44,056 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:44,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1687924148, now seen corresponding path program 2 times [2018-12-02 05:37:44,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:44,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:44,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:44,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:44,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:37:44,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:37:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:37:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:37:44,169 INFO L87 Difference]: Start difference. First operand 39103 states and 165629 transitions. Second operand 12 states. [2018-12-02 05:37:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:44,624 INFO L93 Difference]: Finished difference Result 55473 states and 227887 transitions. [2018-12-02 05:37:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:37:44,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-02 05:37:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:44,714 INFO L225 Difference]: With dead ends: 55473 [2018-12-02 05:37:44,714 INFO L226 Difference]: Without dead ends: 48829 [2018-12-02 05:37:44,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:37:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48829 states. [2018-12-02 05:37:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48829 to 38756. [2018-12-02 05:37:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38756 states. [2018-12-02 05:37:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38756 states to 38756 states and 164262 transitions. [2018-12-02 05:37:45,352 INFO L78 Accepts]: Start accepts. Automaton has 38756 states and 164262 transitions. Word has length 46 [2018-12-02 05:37:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:45,352 INFO L480 AbstractCegarLoop]: Abstraction has 38756 states and 164262 transitions. [2018-12-02 05:37:45,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:37:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38756 states and 164262 transitions. [2018-12-02 05:37:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:45,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:45,364 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-12-02 05:37:45,365 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:45,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2121874178, now seen corresponding path program 1 times [2018-12-02 05:37:45,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:45,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:45,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:45,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:45,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 05:37:45,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:37:45,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:37:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:37:45,754 INFO L87 Difference]: Start difference. First operand 38756 states and 164262 transitions. Second operand 17 states. [2018-12-02 05:37:46,453 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-12-02 05:37:46,629 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-02 05:37:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:47,804 INFO L93 Difference]: Finished difference Result 47709 states and 201870 transitions. [2018-12-02 05:37:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:37:47,805 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-02 05:37:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:47,989 INFO L225 Difference]: With dead ends: 47709 [2018-12-02 05:37:47,989 INFO L226 Difference]: Without dead ends: 47403 [2018-12-02 05:37:47,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-12-02 05:37:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47403 states. [2018-12-02 05:37:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47403 to 40796. [2018-12-02 05:37:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40796 states. [2018-12-02 05:37:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40796 states to 40796 states and 173951 transitions. [2018-12-02 05:37:48,577 INFO L78 Accepts]: Start accepts. Automaton has 40796 states and 173951 transitions. Word has length 46 [2018-12-02 05:37:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:48,577 INFO L480 AbstractCegarLoop]: Abstraction has 40796 states and 173951 transitions. [2018-12-02 05:37:48,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:37:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 40796 states and 173951 transitions. [2018-12-02 05:37:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:48,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:48,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:37:48,591 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:48,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash 89732511, now seen corresponding path program 1 times [2018-12-02 05:37:48,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:48,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:48,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:48,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:48,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:48,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 05:37:48,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:37:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:37:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:37:48,924 INFO L87 Difference]: Start difference. First operand 40796 states and 173951 transitions. Second operand 17 states. [2018-12-02 05:37:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:49,842 INFO L93 Difference]: Finished difference Result 48941 states and 207557 transitions. [2018-12-02 05:37:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 05:37:49,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-02 05:37:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:49,934 INFO L225 Difference]: With dead ends: 48941 [2018-12-02 05:37:49,934 INFO L226 Difference]: Without dead ends: 48635 [2018-12-02 05:37:49,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-12-02 05:37:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2018-12-02 05:37:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 40772. [2018-12-02 05:37:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2018-12-02 05:37:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2018-12-02 05:37:50,583 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2018-12-02 05:37:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:50,583 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2018-12-02 05:37:50,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:37:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2018-12-02 05:37:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:50,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:50,595 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-12-02 05:37:50,595 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:50,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1822746999, now seen corresponding path program 2 times [2018-12-02 05:37:50,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:50,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:50,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:50,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:50,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:50,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 05:37:50,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:37:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:37:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:37:50,926 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 17 states. [2018-12-02 05:37:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:52,055 INFO L93 Difference]: Finished difference Result 49993 states and 209684 transitions. [2018-12-02 05:37:52,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 05:37:52,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-02 05:37:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:52,150 INFO L225 Difference]: With dead ends: 49993 [2018-12-02 05:37:52,150 INFO L226 Difference]: Without dead ends: 49687 [2018-12-02 05:37:52,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 05:37:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49687 states. [2018-12-02 05:37:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49687 to 38645. [2018-12-02 05:37:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2018-12-02 05:37:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2018-12-02 05:37:52,794 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2018-12-02 05:37:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:52,795 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2018-12-02 05:37:52,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:37:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2018-12-02 05:37:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:52,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:52,806 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-12-02 05:37:52,807 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:52,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:52,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1548751685, now seen corresponding path program 1 times [2018-12-02 05:37:52,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:52,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:52,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:53,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:53,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 05:37:53,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:37:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:37:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:37:53,243 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 19 states. [2018-12-02 05:37:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:54,223 INFO L93 Difference]: Finished difference Result 48949 states and 208196 transitions. [2018-12-02 05:37:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:37:54,223 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-12-02 05:37:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:54,314 INFO L225 Difference]: With dead ends: 48949 [2018-12-02 05:37:54,314 INFO L226 Difference]: Without dead ends: 48703 [2018-12-02 05:37:54,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-02 05:37:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48703 states. [2018-12-02 05:37:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48703 to 38308. [2018-12-02 05:37:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38308 states. [2018-12-02 05:37:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38308 states to 38308 states and 162641 transitions. [2018-12-02 05:37:54,956 INFO L78 Accepts]: Start accepts. Automaton has 38308 states and 162641 transitions. Word has length 46 [2018-12-02 05:37:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:54,956 INFO L480 AbstractCegarLoop]: Abstraction has 38308 states and 162641 transitions. [2018-12-02 05:37:54,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:37:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 38308 states and 162641 transitions. [2018-12-02 05:37:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:37:54,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:54,969 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-12-02 05:37:54,969 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash -475658810, now seen corresponding path program 2 times [2018-12-02 05:37:54,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:54,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:55,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:55,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:37:55,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:37:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:37:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:37:55,063 INFO L87 Difference]: Start difference. First operand 38308 states and 162641 transitions. Second operand 12 states. [2018-12-02 05:37:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:55,502 INFO L93 Difference]: Finished difference Result 52333 states and 220932 transitions. [2018-12-02 05:37:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:37:55,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-02 05:37:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:55,604 INFO L225 Difference]: With dead ends: 52333 [2018-12-02 05:37:55,604 INFO L226 Difference]: Without dead ends: 52027 [2018-12-02 05:37:55,605 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-12-02 05:37:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2018-12-02 05:37:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 38150. [2018-12-02 05:37:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38150 states. [2018-12-02 05:37:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38150 states to 38150 states and 162226 transitions. [2018-12-02 05:37:56,485 INFO L78 Accepts]: Start accepts. Automaton has 38150 states and 162226 transitions. Word has length 46 [2018-12-02 05:37:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:56,486 INFO L480 AbstractCegarLoop]: Abstraction has 38150 states and 162226 transitions. [2018-12-02 05:37:56,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:37:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 38150 states and 162226 transitions. [2018-12-02 05:37:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:37:56,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:56,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:37:56,504 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:56,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash -712228033, now seen corresponding path program 1 times [2018-12-02 05:37:56,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:56,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:56,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:37:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:56,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:56,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 05:37:56,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:37:56,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:37:56,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:37:56,932 INFO L87 Difference]: Start difference. First operand 38150 states and 162226 transitions. Second operand 19 states. [2018-12-02 05:37:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:57,731 INFO L93 Difference]: Finished difference Result 46294 states and 195371 transitions. [2018-12-02 05:37:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:37:57,732 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-02 05:37:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:57,820 INFO L225 Difference]: With dead ends: 46294 [2018-12-02 05:37:57,821 INFO L226 Difference]: Without dead ends: 45988 [2018-12-02 05:37:57,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-12-02 05:37:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45988 states. [2018-12-02 05:37:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45988 to 36584. [2018-12-02 05:37:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36584 states. [2018-12-02 05:37:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36584 states to 36584 states and 155048 transitions. [2018-12-02 05:37:58,432 INFO L78 Accepts]: Start accepts. Automaton has 36584 states and 155048 transitions. Word has length 48 [2018-12-02 05:37:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:37:58,432 INFO L480 AbstractCegarLoop]: Abstraction has 36584 states and 155048 transitions. [2018-12-02 05:37:58,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:37:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 36584 states and 155048 transitions. [2018-12-02 05:37:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:37:58,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:37:58,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:37:58,449 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:37:58,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:37:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1120442176, now seen corresponding path program 1 times [2018-12-02 05:37:58,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:37:58,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:37:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:58,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:37:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:37:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:37:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:37:58,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:37:58,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 05:37:58,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:37:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:37:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:37:58,850 INFO L87 Difference]: Start difference. First operand 36584 states and 155048 transitions. Second operand 18 states. [2018-12-02 05:37:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:37:59,843 INFO L93 Difference]: Finished difference Result 42357 states and 177918 transitions. [2018-12-02 05:37:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:37:59,844 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-12-02 05:37:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:37:59,922 INFO L225 Difference]: With dead ends: 42357 [2018-12-02 05:37:59,922 INFO L226 Difference]: Without dead ends: 42051 [2018-12-02 05:37:59,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-12-02 05:38:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42051 states. [2018-12-02 05:38:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42051 to 34160. [2018-12-02 05:38:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2018-12-02 05:38:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2018-12-02 05:38:00,485 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2018-12-02 05:38:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:00,485 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2018-12-02 05:38:00,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:38:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2018-12-02 05:38:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:38:00,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:00,501 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-12-02 05:38:00,501 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:00,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash 799656368, now seen corresponding path program 1 times [2018-12-02 05:38:00,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:00,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:00,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:00,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:38:00,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:38:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:38:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:38:00,539 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 7 states. [2018-12-02 05:38:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:00,804 INFO L93 Difference]: Finished difference Result 38880 states and 161858 transitions. [2018-12-02 05:38:00,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:38:00,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-02 05:38:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:00,874 INFO L225 Difference]: With dead ends: 38880 [2018-12-02 05:38:00,875 INFO L226 Difference]: Without dead ends: 38046 [2018-12-02 05:38:00,875 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-12-02 05:38:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2018-12-02 05:38:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 36228. [2018-12-02 05:38:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2018-12-02 05:38:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2018-12-02 05:38:01,568 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2018-12-02 05:38:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:01,568 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2018-12-02 05:38:01,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:38:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2018-12-02 05:38:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:38:01,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:01,584 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-12-02 05:38:01,584 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:01,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1212289711, now seen corresponding path program 1 times [2018-12-02 05:38:01,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:01,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:01,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:01,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:01,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:38:01,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:38:01,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:38:01,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:38:01,743 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 14 states. [2018-12-02 05:38:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:02,271 INFO L93 Difference]: Finished difference Result 55817 states and 227535 transitions. [2018-12-02 05:38:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:38:02,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-12-02 05:38:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:02,363 INFO L225 Difference]: With dead ends: 55817 [2018-12-02 05:38:02,364 INFO L226 Difference]: Without dead ends: 41649 [2018-12-02 05:38:02,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-12-02 05:38:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41649 states. [2018-12-02 05:38:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41649 to 31649. [2018-12-02 05:38:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31649 states. [2018-12-02 05:38:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 132071 transitions. [2018-12-02 05:38:02,916 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 132071 transitions. Word has length 49 [2018-12-02 05:38:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:02,916 INFO L480 AbstractCegarLoop]: Abstraction has 31649 states and 132071 transitions. [2018-12-02 05:38:02,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:38:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 132071 transitions. [2018-12-02 05:38:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:38:02,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:02,932 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-12-02 05:38:02,932 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:02,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1269167334, now seen corresponding path program 1 times [2018-12-02 05:38:02,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:02,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:03,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:03,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:03,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:03,574 INFO L87 Difference]: Start difference. First operand 31649 states and 132071 transitions. Second operand 21 states. [2018-12-02 05:38:04,163 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-12-02 05:38:04,657 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2018-12-02 05:38:04,815 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2018-12-02 05:38:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:06,611 INFO L93 Difference]: Finished difference Result 55168 states and 228464 transitions. [2018-12-02 05:38:06,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 05:38:06,612 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-12-02 05:38:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:06,718 INFO L225 Difference]: With dead ends: 55168 [2018-12-02 05:38:06,718 INFO L226 Difference]: Without dead ends: 54346 [2018-12-02 05:38:06,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 05:38:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54346 states. [2018-12-02 05:38:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54346 to 35364. [2018-12-02 05:38:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-02 05:38:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-02 05:38:07,364 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-02 05:38:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:07,364 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-02 05:38:07,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-02 05:38:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:38:07,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:07,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:07,382 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:07,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 710299090, now seen corresponding path program 2 times [2018-12-02 05:38:07,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:07,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:07,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:07,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:07,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 05:38:07,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 05:38:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 05:38:07,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:38:07,584 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 16 states. [2018-12-02 05:38:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:07,958 INFO L93 Difference]: Finished difference Result 39597 states and 166907 transitions. [2018-12-02 05:38:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:38:07,959 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-02 05:38:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:08,030 INFO L225 Difference]: With dead ends: 39597 [2018-12-02 05:38:08,030 INFO L226 Difference]: Without dead ends: 38958 [2018-12-02 05:38:08,031 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-12-02 05:38:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38958 states. [2018-12-02 05:38:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38958 to 35364. [2018-12-02 05:38:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-02 05:38:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-02 05:38:08,627 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-02 05:38:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:08,627 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-02 05:38:08,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 05:38:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-02 05:38:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:38:08,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:08,645 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-12-02 05:38:08,645 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:08,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash 227988774, now seen corresponding path program 3 times [2018-12-02 05:38:08,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:08,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:08,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:09,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-12-02 05:38:09,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 05:38:09,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:38:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:38:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:38:09,056 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 19 states. [2018-12-02 05:38:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:09,937 INFO L93 Difference]: Finished difference Result 41619 states and 175078 transitions. [2018-12-02 05:38:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:38:09,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-02 05:38:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:10,011 INFO L225 Difference]: With dead ends: 41619 [2018-12-02 05:38:10,011 INFO L226 Difference]: Without dead ends: 40980 [2018-12-02 05:38:10,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-12-02 05:38:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40980 states. [2018-12-02 05:38:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40980 to 35412. [2018-12-02 05:38:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35412 states. [2018-12-02 05:38:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35412 states to 35412 states and 150956 transitions. [2018-12-02 05:38:10,554 INFO L78 Accepts]: Start accepts. Automaton has 35412 states and 150956 transitions. Word has length 49 [2018-12-02 05:38:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:10,554 INFO L480 AbstractCegarLoop]: Abstraction has 35412 states and 150956 transitions. [2018-12-02 05:38:10,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:38:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 35412 states and 150956 transitions. [2018-12-02 05:38:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:38:10,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:10,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:10,572 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -344784414, now seen corresponding path program 4 times [2018-12-02 05:38:10,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:10,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:10,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:10,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 05:38:10,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 05:38:10,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 05:38:10,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:38:10,771 INFO L87 Difference]: Start difference. First operand 35412 states and 150956 transitions. Second operand 16 states. [2018-12-02 05:38:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:11,213 INFO L93 Difference]: Finished difference Result 44552 states and 186042 transitions. [2018-12-02 05:38:11,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:38:11,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-02 05:38:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:11,293 INFO L225 Difference]: With dead ends: 44552 [2018-12-02 05:38:11,293 INFO L226 Difference]: Without dead ends: 43913 [2018-12-02 05:38:11,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-12-02 05:38:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43913 states. [2018-12-02 05:38:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43913 to 34825. [2018-12-02 05:38:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34825 states. [2018-12-02 05:38:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 148359 transitions. [2018-12-02 05:38:11,853 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 148359 transitions. Word has length 49 [2018-12-02 05:38:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:11,854 INFO L480 AbstractCegarLoop]: Abstraction has 34825 states and 148359 transitions. [2018-12-02 05:38:11,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 05:38:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 148359 transitions. [2018-12-02 05:38:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:11,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:11,875 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-12-02 05:38:11,875 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:11,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1190448904, now seen corresponding path program 1 times [2018-12-02 05:38:11,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:11,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:11,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:11,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:11,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:12,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:12,548 INFO L87 Difference]: Start difference. First operand 34825 states and 148359 transitions. Second operand 21 states. [2018-12-02 05:38:12,984 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-12-02 05:38:13,113 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-12-02 05:38:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:14,717 INFO L93 Difference]: Finished difference Result 36224 states and 150699 transitions. [2018-12-02 05:38:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 05:38:14,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 05:38:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:14,781 INFO L225 Difference]: With dead ends: 36224 [2018-12-02 05:38:14,781 INFO L226 Difference]: Without dead ends: 35180 [2018-12-02 05:38:14,781 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-12-02 05:38:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35180 states. [2018-12-02 05:38:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35180 to 29756. [2018-12-02 05:38:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2018-12-02 05:38:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 124486 transitions. [2018-12-02 05:38:15,303 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 124486 transitions. Word has length 51 [2018-12-02 05:38:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:15,303 INFO L480 AbstractCegarLoop]: Abstraction has 29756 states and 124486 transitions. [2018-12-02 05:38:15,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 124486 transitions. [2018-12-02 05:38:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:15,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:15,323 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-12-02 05:38:15,323 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:15,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1275829881, now seen corresponding path program 1 times [2018-12-02 05:38:15,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:15,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:15,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:15,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:15,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:15,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:15,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:15,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:15,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:15,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:15,841 INFO L87 Difference]: Start difference. First operand 29756 states and 124486 transitions. Second operand 21 states. [2018-12-02 05:38:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:17,382 INFO L93 Difference]: Finished difference Result 37835 states and 157450 transitions. [2018-12-02 05:38:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 05:38:17,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 05:38:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:17,463 INFO L225 Difference]: With dead ends: 37835 [2018-12-02 05:38:17,463 INFO L226 Difference]: Without dead ends: 36917 [2018-12-02 05:38:17,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 05:38:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36917 states. [2018-12-02 05:38:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36917 to 25502. [2018-12-02 05:38:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25502 states. [2018-12-02 05:38:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25502 states to 25502 states and 105052 transitions. [2018-12-02 05:38:17,917 INFO L78 Accepts]: Start accepts. Automaton has 25502 states and 105052 transitions. Word has length 51 [2018-12-02 05:38:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:17,917 INFO L480 AbstractCegarLoop]: Abstraction has 25502 states and 105052 transitions. [2018-12-02 05:38:17,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25502 states and 105052 transitions. [2018-12-02 05:38:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:17,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:17,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-12-02 05:38:17,934 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:17,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1589892095, now seen corresponding path program 2 times [2018-12-02 05:38:17,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:17,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:18,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:18,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:18,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:18,767 INFO L87 Difference]: Start difference. First operand 25502 states and 105052 transitions. Second operand 21 states. [2018-12-02 05:38:19,417 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-12-02 05:38:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:21,081 INFO L93 Difference]: Finished difference Result 38880 states and 159223 transitions. [2018-12-02 05:38:21,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 05:38:21,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 05:38:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:21,149 INFO L225 Difference]: With dead ends: 38880 [2018-12-02 05:38:21,149 INFO L226 Difference]: Without dead ends: 38574 [2018-12-02 05:38:21,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 05:38:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38574 states. [2018-12-02 05:38:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38574 to 20447. [2018-12-02 05:38:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20447 states. [2018-12-02 05:38:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20447 states to 20447 states and 83415 transitions. [2018-12-02 05:38:21,540 INFO L78 Accepts]: Start accepts. Automaton has 20447 states and 83415 transitions. Word has length 51 [2018-12-02 05:38:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:21,540 INFO L480 AbstractCegarLoop]: Abstraction has 20447 states and 83415 transitions. [2018-12-02 05:38:21,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20447 states and 83415 transitions. [2018-12-02 05:38:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:21,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:21,552 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-12-02 05:38:21,552 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:21,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1569150769, now seen corresponding path program 1 times [2018-12-02 05:38:21,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:21,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:21,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:21,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:22,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:22,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 05:38:22,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:38:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:38:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:38:22,028 INFO L87 Difference]: Start difference. First operand 20447 states and 83415 transitions. Second operand 19 states. [2018-12-02 05:38:22,538 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-12-02 05:38:22,696 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-02 05:38:22,828 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-02 05:38:23,014 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-02 05:38:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:23,961 INFO L93 Difference]: Finished difference Result 25964 states and 104818 transitions. [2018-12-02 05:38:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:38:23,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-02 05:38:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:24,004 INFO L225 Difference]: With dead ends: 25964 [2018-12-02 05:38:24,005 INFO L226 Difference]: Without dead ends: 25595 [2018-12-02 05:38:24,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2018-12-02 05:38:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25595 states. [2018-12-02 05:38:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25595 to 20399. [2018-12-02 05:38:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2018-12-02 05:38:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2018-12-02 05:38:24,354 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 51 [2018-12-02 05:38:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:24,354 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2018-12-02 05:38:24,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:38:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2018-12-02 05:38:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:24,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:24,366 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-12-02 05:38:24,366 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:24,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 514067265, now seen corresponding path program 2 times [2018-12-02 05:38:24,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:24,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:24,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:24,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 05:38:24,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:38:24,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:38:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:38:24,808 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 19 states. [2018-12-02 05:38:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:25,928 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2018-12-02 05:38:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 05:38:25,928 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-02 05:38:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:25,972 INFO L225 Difference]: With dead ends: 27038 [2018-12-02 05:38:25,972 INFO L226 Difference]: Without dead ends: 26669 [2018-12-02 05:38:25,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 05:38:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2018-12-02 05:38:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2018-12-02 05:38:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-12-02 05:38:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2018-12-02 05:38:26,287 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2018-12-02 05:38:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:26,288 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2018-12-02 05:38:26,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:38:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2018-12-02 05:38:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:26,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:26,300 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-12-02 05:38:26,300 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:26,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash -292569965, now seen corresponding path program 1 times [2018-12-02 05:38:26,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:26,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:26,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 05:38:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:38:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:38:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:38:26,663 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2018-12-02 05:38:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:27,251 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2018-12-02 05:38:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:38:27,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-12-02 05:38:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:27,295 INFO L225 Difference]: With dead ends: 26099 [2018-12-02 05:38:27,295 INFO L226 Difference]: Without dead ends: 25550 [2018-12-02 05:38:27,295 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-12-02 05:38:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2018-12-02 05:38:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2018-12-02 05:38:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2018-12-02 05:38:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2018-12-02 05:38:27,601 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2018-12-02 05:38:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:27,602 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2018-12-02 05:38:27,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:38:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2018-12-02 05:38:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:38:27,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:27,613 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-12-02 05:38:27,614 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:27,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash -774880281, now seen corresponding path program 2 times [2018-12-02 05:38:27,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:27,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:28,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:28,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:28,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:28,181 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2018-12-02 05:38:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:29,526 INFO L93 Difference]: Finished difference Result 24529 states and 99196 transitions. [2018-12-02 05:38:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 05:38:29,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 05:38:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:29,561 INFO L225 Difference]: With dead ends: 24529 [2018-12-02 05:38:29,561 INFO L226 Difference]: Without dead ends: 22702 [2018-12-02 05:38:29,562 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-12-02 05:38:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2018-12-02 05:38:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 17110. [2018-12-02 05:38:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2018-12-02 05:38:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 69704 transitions. [2018-12-02 05:38:29,825 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 69704 transitions. Word has length 51 [2018-12-02 05:38:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:29,826 INFO L480 AbstractCegarLoop]: Abstraction has 17110 states and 69704 transitions. [2018-12-02 05:38:29,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 69704 transitions. [2018-12-02 05:38:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:38:29,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:29,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:29,836 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:29,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash -210797077, now seen corresponding path program 1 times [2018-12-02 05:38:29,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:29,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:29,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:38:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:38:29,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:38:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:38:29,891 INFO L87 Difference]: Start difference. First operand 17110 states and 69704 transitions. Second operand 7 states. [2018-12-02 05:38:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:30,078 INFO L93 Difference]: Finished difference Result 20102 states and 80003 transitions. [2018-12-02 05:38:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:38:30,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 05:38:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:30,108 INFO L225 Difference]: With dead ends: 20102 [2018-12-02 05:38:30,108 INFO L226 Difference]: Without dead ends: 19382 [2018-12-02 05:38:30,108 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-12-02 05:38:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19382 states. [2018-12-02 05:38:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19382 to 18962. [2018-12-02 05:38:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18962 states. [2018-12-02 05:38:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18962 states to 18962 states and 76406 transitions. [2018-12-02 05:38:30,360 INFO L78 Accepts]: Start accepts. Automaton has 18962 states and 76406 transitions. Word has length 52 [2018-12-02 05:38:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:30,360 INFO L480 AbstractCegarLoop]: Abstraction has 18962 states and 76406 transitions. [2018-12-02 05:38:30,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:38:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18962 states and 76406 transitions. [2018-12-02 05:38:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:38:30,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:30,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:30,373 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:30,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1972668099, now seen corresponding path program 2 times [2018-12-02 05:38:30,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:30,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:30,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:30,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:30,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:30,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:30,911 INFO L87 Difference]: Start difference. First operand 18962 states and 76406 transitions. Second operand 21 states. [2018-12-02 05:38:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:32,224 INFO L93 Difference]: Finished difference Result 24590 states and 97599 transitions. [2018-12-02 05:38:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 05:38:32,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-02 05:38:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:32,257 INFO L225 Difference]: With dead ends: 24590 [2018-12-02 05:38:32,257 INFO L226 Difference]: Without dead ends: 22430 [2018-12-02 05:38:32,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 05:38:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2018-12-02 05:38:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 18290. [2018-12-02 05:38:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2018-12-02 05:38:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 73678 transitions. [2018-12-02 05:38:32,518 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 73678 transitions. Word has length 52 [2018-12-02 05:38:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:32,518 INFO L480 AbstractCegarLoop]: Abstraction has 18290 states and 73678 transitions. [2018-12-02 05:38:32,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 73678 transitions. [2018-12-02 05:38:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:38:32,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:32,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:32,531 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:32,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1930062503, now seen corresponding path program 3 times [2018-12-02 05:38:32,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:32,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:32,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:32,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:32,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:32,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:32,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 05:38:32,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:38:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:38:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:38:32,901 INFO L87 Difference]: Start difference. First operand 18290 states and 73678 transitions. Second operand 18 states. [2018-12-02 05:38:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:33,293 INFO L93 Difference]: Finished difference Result 24227 states and 94267 transitions. [2018-12-02 05:38:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:38:33,293 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-02 05:38:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:33,327 INFO L225 Difference]: With dead ends: 24227 [2018-12-02 05:38:33,327 INFO L226 Difference]: Without dead ends: 23507 [2018-12-02 05:38:33,327 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-12-02 05:38:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2018-12-02 05:38:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 17551. [2018-12-02 05:38:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17551 states. [2018-12-02 05:38:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17551 states to 17551 states and 70727 transitions. [2018-12-02 05:38:33,584 INFO L78 Accepts]: Start accepts. Automaton has 17551 states and 70727 transitions. Word has length 52 [2018-12-02 05:38:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:33,584 INFO L480 AbstractCegarLoop]: Abstraction has 17551 states and 70727 transitions. [2018-12-02 05:38:33,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:38:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17551 states and 70727 transitions. [2018-12-02 05:38:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:38:33,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:33,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:33,597 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:33,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash 430172722, now seen corresponding path program 1 times [2018-12-02 05:38:33,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:33,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:33,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:34,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:34,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:34,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:34,364 INFO L87 Difference]: Start difference. First operand 17551 states and 70727 transitions. Second operand 21 states. [2018-12-02 05:38:35,243 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-12-02 05:38:35,453 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2018-12-02 05:38:35,776 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2018-12-02 05:38:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:37,649 INFO L93 Difference]: Finished difference Result 25327 states and 100129 transitions. [2018-12-02 05:38:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 05:38:37,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-12-02 05:38:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:37,701 INFO L225 Difference]: With dead ends: 25327 [2018-12-02 05:38:37,701 INFO L226 Difference]: Without dead ends: 25012 [2018-12-02 05:38:37,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 05:38:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25012 states. [2018-12-02 05:38:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25012 to 13402. [2018-12-02 05:38:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2018-12-02 05:38:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 53709 transitions. [2018-12-02 05:38:37,943 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 53709 transitions. Word has length 53 [2018-12-02 05:38:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:37,943 INFO L480 AbstractCegarLoop]: Abstraction has 13402 states and 53709 transitions. [2018-12-02 05:38:37,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 53709 transitions. [2018-12-02 05:38:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:38:37,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:37,955 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-12-02 05:38:37,955 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:37,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1341438564, now seen corresponding path program 1 times [2018-12-02 05:38:37,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:37,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:37,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:37,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:37,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:38,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:38,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:38,652 INFO L87 Difference]: Start difference. First operand 13402 states and 53709 transitions. Second operand 21 states. [2018-12-02 05:38:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:40,201 INFO L93 Difference]: Finished difference Result 22774 states and 89010 transitions. [2018-12-02 05:38:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 05:38:40,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-02 05:38:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:40,235 INFO L225 Difference]: With dead ends: 22774 [2018-12-02 05:38:40,235 INFO L226 Difference]: Without dead ends: 22198 [2018-12-02 05:38:40,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:38:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2018-12-02 05:38:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 12634. [2018-12-02 05:38:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2018-12-02 05:38:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2018-12-02 05:38:40,452 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 54 [2018-12-02 05:38:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:40,453 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2018-12-02 05:38:40,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2018-12-02 05:38:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:38:40,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:40,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:40,464 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1434717976, now seen corresponding path program 2 times [2018-12-02 05:38:40,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:40,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:41,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:41,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 05:38:41,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:38:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:38:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:38:41,151 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 21 states. [2018-12-02 05:38:42,131 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-12-02 05:38:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:43,061 INFO L93 Difference]: Finished difference Result 12034 states and 46239 transitions. [2018-12-02 05:38:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 05:38:43,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-02 05:38:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:43,087 INFO L225 Difference]: With dead ends: 12034 [2018-12-02 05:38:43,087 INFO L226 Difference]: Without dead ends: 11458 [2018-12-02 05:38:43,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 05:38:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2018-12-02 05:38:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6913. [2018-12-02 05:38:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2018-12-02 05:38:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2018-12-02 05:38:43,197 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2018-12-02 05:38:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:43,197 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2018-12-02 05:38:43,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:38:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2018-12-02 05:38:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 05:38:43,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:43,205 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-12-02 05:38:43,205 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:43,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1240823866, now seen corresponding path program 1 times [2018-12-02 05:38:43,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:43,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:43,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:38:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:43,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-12-02 05:38:43,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:43,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:38:43,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:38:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:38:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:38:43,256 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 9 states. [2018-12-02 05:38:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:43,377 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2018-12-02 05:38:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:38:43,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-02 05:38:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:43,388 INFO L225 Difference]: With dead ends: 6913 [2018-12-02 05:38:43,388 INFO L226 Difference]: Without dead ends: 6868 [2018-12-02 05:38:43,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:38:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2018-12-02 05:38:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2018-12-02 05:38:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2018-12-02 05:38:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2018-12-02 05:38:43,468 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2018-12-02 05:38:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:43,469 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2018-12-02 05:38:43,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:38:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2018-12-02 05:38:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 05:38:43,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:38:43,477 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:43,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash 941155209, now seen corresponding path program 1 times [2018-12-02 05:38:43,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:43,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:43,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:43,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:43,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:38:43,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:38:43,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:38:43,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:38:43,540 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2018-12-02 05:38:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:43,656 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2018-12-02 05:38:43,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:38:43,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-02 05:38:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:43,666 INFO L225 Difference]: With dead ends: 6868 [2018-12-02 05:38:43,666 INFO L226 Difference]: Without dead ends: 6670 [2018-12-02 05:38:43,667 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-12-02 05:38:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2018-12-02 05:38:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2018-12-02 05:38:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2018-12-02 05:38:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2018-12-02 05:38:43,744 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2018-12-02 05:38:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:43,744 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2018-12-02 05:38:43,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:38:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2018-12-02 05:38:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 05:38:43,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:43,751 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-12-02 05:38:43,752 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:43,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:43,752 INFO L82 PathProgramCache]: Analyzing trace with hash 116030204, now seen corresponding path program 1 times [2018-12-02 05:38:43,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:43,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:43,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:43,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:38:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:38:43,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:38:43,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:38:43,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:38:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:38:43,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:38:43,868 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 10 states. [2018-12-02 05:38:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:38:44,088 INFO L93 Difference]: Finished difference Result 6670 states and 27264 transitions. [2018-12-02 05:38:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:38:44,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-02 05:38:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:38:44,101 INFO L225 Difference]: With dead ends: 6670 [2018-12-02 05:38:44,101 INFO L226 Difference]: Without dead ends: 6328 [2018-12-02 05:38:44,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:38:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2018-12-02 05:38:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6328. [2018-12-02 05:38:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-02 05:38:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 25848 transitions. [2018-12-02 05:38:44,177 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 25848 transitions. Word has length 87 [2018-12-02 05:38:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:38:44,177 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 25848 transitions. [2018-12-02 05:38:44,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:38:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 25848 transitions. [2018-12-02 05:38:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 05:38:44,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:38:44,184 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-12-02 05:38:44,184 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:38:44,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:38:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1769800394, now seen corresponding path program 1 times [2018-12-02 05:38:44,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:38:44,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:38:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:38:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:38:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:38:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:38:44,217 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:38:44,279 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 05:38:44,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:38:44 BasicIcfg [2018-12-02 05:38:44,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:38:44,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:38:44,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:38:44,280 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:38:44,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:27" (3/4) ... [2018-12-02 05:38:44,282 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:38:44,335 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5de712a1-e6e4-4432-b38e-d5c3e74cce7a/bin-2019/uautomizer/witness.graphml [2018-12-02 05:38:44,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:38:44,336 INFO L168 Benchmark]: Toolchain (without parser) took 77696.95 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 951.7 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 05:38:44,336 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:38:44,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:38:44,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:38:44,337 INFO L168 Benchmark]: Boogie Preprocessor took 15.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:38:44,337 INFO L168 Benchmark]: RCFGBuilder took 200.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:38:44,337 INFO L168 Benchmark]: TraceAbstraction took 76991.57 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 05:38:44,338 INFO L168 Benchmark]: Witness Printer took 55.64 ms. Allocated memory is still 4.6 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:38:44,339 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76991.57 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 55.64 ms. Allocated memory is still 4.6 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95: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={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1217] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1248] -1 \read(t) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1235] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t4={91:0}, t5={95:0}, v={92: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))={92:0}, t5={95:0}, v={92: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))={92:0}, v={92: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))={92:0}, v={92: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))={92:0}, v={92: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))={92:0}, v={92: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))={92:0}, v={92:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 1 error locations. UNSAFE Result, 76.8s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 42.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7720 SDtfs, 22631 SDslu, 50523 SDs, 0 SdLazy, 23138 SolverSat, 3034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 151 SyntacticMatches, 46 SemanticMatches, 1010 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6368 ImplicationChecksByTransitivity, 29.7s 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: 18.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 292546 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2055 NumberOfCodeBlocks, 2055 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1929 ConstructedInterpolants, 0 QuantifiedInterpolants, 1799036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...