./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:28:52,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:28:52,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:28:52,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:28:52,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:28:52,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:28:52,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:28:52,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:28:52,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:28:52,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:28:52,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:28:52,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:28:52,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:28:52,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:28:52,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:28:52,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:28:52,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:28:52,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:28:52,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:28:52,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:28:52,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:28:52,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:28:52,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:28:52,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:28:52,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:28:52,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:28:52,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:28:52,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:28:52,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:28:52,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:28:52,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:28:52,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:28:52,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:28:52,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:28:52,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:28:52,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:28:52,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:28:52,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:28:52,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:28:52,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:28:52,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:28:52,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:28:52,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:28:52,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:28:52,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:28:52,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:28:52,262 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:28:52,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:28:52,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:28:52,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:28:52,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:28:52,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:28:52,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:28:52,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:28:52,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:28:52,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:28:52,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:28:52,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:28:52,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:28:52,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:28:52,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:28:52,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:28:52,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:28:52,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:28:52,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:28:52,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:28:52,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:28:52,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:28:52,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:28:52,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:28:52,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-11-15 21:28:52,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:28:52,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:28:52,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:28:52,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:28:52,321 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:28:52,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2019-11-15 21:28:52,376 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/data/684cb9087/79d66a72e2b4497fb465341d1e1365f8/FLAGbe967ffe8 [2019-11-15 21:28:52,781 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:28:52,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/sv-benchmarks/c/locks/test_locks_13.c [2019-11-15 21:28:52,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/data/684cb9087/79d66a72e2b4497fb465341d1e1365f8/FLAGbe967ffe8 [2019-11-15 21:28:53,184 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/data/684cb9087/79d66a72e2b4497fb465341d1e1365f8 [2019-11-15 21:28:53,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:28:53,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:28:53,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:28:53,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:28:53,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:28:53,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6136fe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53, skipping insertion in model container [2019-11-15 21:28:53,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,213 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:28:53,235 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:28:53,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:28:53,452 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:28:53,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:28:53,493 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:28:53,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53 WrapperNode [2019-11-15 21:28:53,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:28:53,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:28:53,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:28:53,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:28:53,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:28:53,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:28:53,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:28:53,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:28:53,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... [2019-11-15 21:28:53,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:28:53,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:28:53,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:28:53,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:28:53,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/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 [2019-11-15 21:28:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:28:53,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:28:54,043 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:28:54,043 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:28:54,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:28:54 BoogieIcfgContainer [2019-11-15 21:28:54,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:28:54,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:28:54,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:28:54,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:28:54,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:28:53" (1/3) ... [2019-11-15 21:28:54,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5779ce02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:28:54, skipping insertion in model container [2019-11-15 21:28:54,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:53" (2/3) ... [2019-11-15 21:28:54,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5779ce02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:28:54, skipping insertion in model container [2019-11-15 21:28:54,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:28:54" (3/3) ... [2019-11-15 21:28:54,058 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-11-15 21:28:54,066 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:28:54,073 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:28:54,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:28:54,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:28:54,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:28:54,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:28:54,114 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:28:54,114 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:28:54,114 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:28:54,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:28:54,115 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:28:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-15 21:28:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:28:54,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,136 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2019-11-15 21:28:54,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476285387] [2019-11-15 21:28:54,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:54,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476285387] [2019-11-15 21:28:54,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:54,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:54,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711459733] [2019-11-15 21:28:54,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:54,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,359 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-11-15 21:28:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:54,416 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2019-11-15 21:28:54,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:54,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 21:28:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:54,432 INFO L225 Difference]: With dead ends: 100 [2019-11-15 21:28:54,432 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 21:28:54,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 21:28:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-11-15 21:28:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 21:28:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-11-15 21:28:54,490 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2019-11-15 21:28:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:54,491 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-11-15 21:28:54,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-11-15 21:28:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:28:54,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2019-11-15 21:28:54,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680357120] [2019-11-15 21:28:54,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:54,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680357120] [2019-11-15 21:28:54,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:54,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:54,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895177125] [2019-11-15 21:28:54,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:54,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,589 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2019-11-15 21:28:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:54,648 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2019-11-15 21:28:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:54,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 21:28:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:54,651 INFO L225 Difference]: With dead ends: 143 [2019-11-15 21:28:54,651 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 21:28:54,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 21:28:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-15 21:28:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 21:28:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2019-11-15 21:28:54,661 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2019-11-15 21:28:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:54,662 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2019-11-15 21:28:54,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2019-11-15 21:28:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:28:54,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,663 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2019-11-15 21:28:54,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414806381] [2019-11-15 21:28:54,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:54,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414806381] [2019-11-15 21:28:54,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:54,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:54,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047151012] [2019-11-15 21:28:54,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:54,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,734 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2019-11-15 21:28:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:54,769 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2019-11-15 21:28:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:54,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 21:28:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:54,771 INFO L225 Difference]: With dead ends: 131 [2019-11-15 21:28:54,771 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 21:28:54,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 21:28:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-15 21:28:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 21:28:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2019-11-15 21:28:54,780 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2019-11-15 21:28:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:54,781 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2019-11-15 21:28:54,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2019-11-15 21:28:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:28:54,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,782 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,782 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2019-11-15 21:28:54,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276882494] [2019-11-15 21:28:54,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:54,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276882494] [2019-11-15 21:28:54,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:54,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:54,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666348384] [2019-11-15 21:28:54,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:54,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,824 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2019-11-15 21:28:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:54,841 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2019-11-15 21:28:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:54,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 21:28:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:54,844 INFO L225 Difference]: With dead ends: 168 [2019-11-15 21:28:54,844 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:28:54,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:28:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2019-11-15 21:28:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 21:28:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2019-11-15 21:28:54,857 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2019-11-15 21:28:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:54,857 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2019-11-15 21:28:54,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2019-11-15 21:28:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:28:54,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,859 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2019-11-15 21:28:54,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286709716] [2019-11-15 21:28:54,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:54,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286709716] [2019-11-15 21:28:54,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:54,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:54,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701435589] [2019-11-15 21:28:54,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:54,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,889 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2019-11-15 21:28:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:54,912 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2019-11-15 21:28:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:54,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 21:28:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:54,915 INFO L225 Difference]: With dead ends: 280 [2019-11-15 21:28:54,915 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 21:28:54,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 21:28:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-11-15 21:28:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 21:28:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2019-11-15 21:28:54,930 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2019-11-15 21:28:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:54,930 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2019-11-15 21:28:54,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2019-11-15 21:28:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:28:54,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,932 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2019-11-15 21:28:54,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903677497] [2019-11-15 21:28:54,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:54,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903677497] [2019-11-15 21:28:54,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:54,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:54,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977195861] [2019-11-15 21:28:54,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:54,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,960 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2019-11-15 21:28:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:54,981 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2019-11-15 21:28:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:54,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 21:28:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:54,983 INFO L225 Difference]: With dead ends: 251 [2019-11-15 21:28:54,983 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 21:28:54,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 21:28:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-11-15 21:28:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:28:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2019-11-15 21:28:54,996 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2019-11-15 21:28:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:54,997 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2019-11-15 21:28:54,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2019-11-15 21:28:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:28:54,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:54,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:54,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2019-11-15 21:28:54,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:54,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216664712] [2019-11-15 21:28:54,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:54,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216664712] [2019-11-15 21:28:55,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746117758] [2019-11-15 21:28:55,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,036 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2019-11-15 21:28:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,061 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2019-11-15 21:28:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 21:28:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,064 INFO L225 Difference]: With dead ends: 488 [2019-11-15 21:28:55,064 INFO L226 Difference]: Without dead ends: 326 [2019-11-15 21:28:55,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-15 21:28:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2019-11-15 21:28:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-15 21:28:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2019-11-15 21:28:55,090 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2019-11-15 21:28:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,092 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2019-11-15 21:28:55,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2019-11-15 21:28:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:28:55,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,095 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:28:55,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2019-11-15 21:28:55,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788645411] [2019-11-15 21:28:55,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788645411] [2019-11-15 21:28:55,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712854905] [2019-11-15 21:28:55,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,131 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2019-11-15 21:28:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,148 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2019-11-15 21:28:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 21:28:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,151 INFO L225 Difference]: With dead ends: 416 [2019-11-15 21:28:55,152 INFO L226 Difference]: Without dead ends: 414 [2019-11-15 21:28:55,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-15 21:28:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2019-11-15 21:28:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-15 21:28:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2019-11-15 21:28:55,164 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2019-11-15 21:28:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,165 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2019-11-15 21:28:55,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2019-11-15 21:28:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:28:55,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,167 INFO L380 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] [2019-11-15 21:28:55,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2019-11-15 21:28:55,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831090654] [2019-11-15 21:28:55,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831090654] [2019-11-15 21:28:55,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936495165] [2019-11-15 21:28:55,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,191 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2019-11-15 21:28:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,210 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2019-11-15 21:28:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 21:28:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,213 INFO L225 Difference]: With dead ends: 612 [2019-11-15 21:28:55,213 INFO L226 Difference]: Without dead ends: 610 [2019-11-15 21:28:55,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-15 21:28:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2019-11-15 21:28:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-15 21:28:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2019-11-15 21:28:55,230 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2019-11-15 21:28:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,230 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2019-11-15 21:28:55,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2019-11-15 21:28:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:28:55,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,232 INFO L380 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] [2019-11-15 21:28:55,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2019-11-15 21:28:55,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119928088] [2019-11-15 21:28:55,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119928088] [2019-11-15 21:28:55,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139391392] [2019-11-15 21:28:55,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,270 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2019-11-15 21:28:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,324 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2019-11-15 21:28:55,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 21:28:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,329 INFO L225 Difference]: With dead ends: 1076 [2019-11-15 21:28:55,329 INFO L226 Difference]: Without dead ends: 634 [2019-11-15 21:28:55,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-15 21:28:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-11-15 21:28:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-15 21:28:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2019-11-15 21:28:55,357 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2019-11-15 21:28:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,357 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2019-11-15 21:28:55,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2019-11-15 21:28:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:28:55,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,360 INFO L380 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] [2019-11-15 21:28:55,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2019-11-15 21:28:55,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655130075] [2019-11-15 21:28:55,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655130075] [2019-11-15 21:28:55,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607290164] [2019-11-15 21:28:55,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,398 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2019-11-15 21:28:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,430 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2019-11-15 21:28:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 21:28:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,434 INFO L225 Difference]: With dead ends: 956 [2019-11-15 21:28:55,435 INFO L226 Difference]: Without dead ends: 646 [2019-11-15 21:28:55,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-15 21:28:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2019-11-15 21:28:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-15 21:28:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2019-11-15 21:28:55,459 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2019-11-15 21:28:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,459 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2019-11-15 21:28:55,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2019-11-15 21:28:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:28:55,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,461 INFO L380 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] [2019-11-15 21:28:55,461 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2019-11-15 21:28:55,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592641981] [2019-11-15 21:28:55,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592641981] [2019-11-15 21:28:55,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452279426] [2019-11-15 21:28:55,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,498 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2019-11-15 21:28:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,529 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2019-11-15 21:28:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 21:28:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,538 INFO L225 Difference]: With dead ends: 1192 [2019-11-15 21:28:55,538 INFO L226 Difference]: Without dead ends: 1190 [2019-11-15 21:28:55,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-15 21:28:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2019-11-15 21:28:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-15 21:28:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2019-11-15 21:28:55,577 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2019-11-15 21:28:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,578 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2019-11-15 21:28:55,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2019-11-15 21:28:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:28:55,580 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,581 INFO L380 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] [2019-11-15 21:28:55,581 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2019-11-15 21:28:55,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743550364] [2019-11-15 21:28:55,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743550364] [2019-11-15 21:28:55,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642919223] [2019-11-15 21:28:55,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,615 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2019-11-15 21:28:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,664 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2019-11-15 21:28:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 21:28:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,673 INFO L225 Difference]: With dead ends: 2136 [2019-11-15 21:28:55,673 INFO L226 Difference]: Without dead ends: 1254 [2019-11-15 21:28:55,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-11-15 21:28:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2019-11-15 21:28:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-11-15 21:28:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2019-11-15 21:28:55,720 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2019-11-15 21:28:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,720 INFO L462 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2019-11-15 21:28:55,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2019-11-15 21:28:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:28:55,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,722 INFO L380 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] [2019-11-15 21:28:55,722 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2019-11-15 21:28:55,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961389233] [2019-11-15 21:28:55,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961389233] [2019-11-15 21:28:55,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352020784] [2019-11-15 21:28:55,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,751 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2019-11-15 21:28:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,784 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2019-11-15 21:28:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 21:28:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,792 INFO L225 Difference]: With dead ends: 1880 [2019-11-15 21:28:55,792 INFO L226 Difference]: Without dead ends: 1270 [2019-11-15 21:28:55,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-15 21:28:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2019-11-15 21:28:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-11-15 21:28:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2019-11-15 21:28:55,836 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2019-11-15 21:28:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,837 INFO L462 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2019-11-15 21:28:55,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2019-11-15 21:28:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:28:55,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,839 INFO L380 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] [2019-11-15 21:28:55,839 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2019-11-15 21:28:55,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050029239] [2019-11-15 21:28:55,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050029239] [2019-11-15 21:28:55,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438038052] [2019-11-15 21:28:55,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,869 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2019-11-15 21:28:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:55,904 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2019-11-15 21:28:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:55,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 21:28:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:55,917 INFO L225 Difference]: With dead ends: 2312 [2019-11-15 21:28:55,917 INFO L226 Difference]: Without dead ends: 2310 [2019-11-15 21:28:55,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-15 21:28:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2019-11-15 21:28:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-11-15 21:28:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2019-11-15 21:28:55,975 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2019-11-15 21:28:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:55,975 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2019-11-15 21:28:55,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2019-11-15 21:28:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:28:55,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:55,978 INFO L380 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] [2019-11-15 21:28:55,978 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2019-11-15 21:28:55,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:55,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458800471] [2019-11-15 21:28:55,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:55,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:55,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458800471] [2019-11-15 21:28:55,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:55,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:55,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641321367] [2019-11-15 21:28:55,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:55,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:55,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:55,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:55,999 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2019-11-15 21:28:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:56,052 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2019-11-15 21:28:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:56,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 21:28:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:56,067 INFO L225 Difference]: With dead ends: 4232 [2019-11-15 21:28:56,067 INFO L226 Difference]: Without dead ends: 2470 [2019-11-15 21:28:56,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-15 21:28:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2019-11-15 21:28:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-11-15 21:28:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2019-11-15 21:28:56,185 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2019-11-15 21:28:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:56,185 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2019-11-15 21:28:56,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2019-11-15 21:28:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:28:56,189 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:56,189 INFO L380 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] [2019-11-15 21:28:56,189 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2019-11-15 21:28:56,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:56,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192894901] [2019-11-15 21:28:56,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:56,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192894901] [2019-11-15 21:28:56,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:56,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:56,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775615967] [2019-11-15 21:28:56,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:56,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:56,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,224 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2019-11-15 21:28:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:56,262 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2019-11-15 21:28:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:56,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 21:28:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:56,275 INFO L225 Difference]: With dead ends: 3704 [2019-11-15 21:28:56,275 INFO L226 Difference]: Without dead ends: 2502 [2019-11-15 21:28:56,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-11-15 21:28:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2019-11-15 21:28:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-11-15 21:28:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2019-11-15 21:28:56,343 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2019-11-15 21:28:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:56,344 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2019-11-15 21:28:56,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2019-11-15 21:28:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:28:56,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:56,348 INFO L380 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] [2019-11-15 21:28:56,348 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2019-11-15 21:28:56,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:56,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494903931] [2019-11-15 21:28:56,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:56,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494903931] [2019-11-15 21:28:56,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:56,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:56,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141763657] [2019-11-15 21:28:56,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:56,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:56,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,384 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2019-11-15 21:28:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:56,439 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2019-11-15 21:28:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:56,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 21:28:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:56,463 INFO L225 Difference]: With dead ends: 4488 [2019-11-15 21:28:56,464 INFO L226 Difference]: Without dead ends: 4486 [2019-11-15 21:28:56,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-15 21:28:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2019-11-15 21:28:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-15 21:28:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2019-11-15 21:28:56,576 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2019-11-15 21:28:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:56,576 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2019-11-15 21:28:56,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2019-11-15 21:28:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:28:56,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:56,581 INFO L380 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] [2019-11-15 21:28:56,582 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2019-11-15 21:28:56,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:56,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605317998] [2019-11-15 21:28:56,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:56,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605317998] [2019-11-15 21:28:56,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:56,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:56,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435212994] [2019-11-15 21:28:56,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:56,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:56,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,601 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2019-11-15 21:28:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:56,679 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2019-11-15 21:28:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:56,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 21:28:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:56,723 INFO L225 Difference]: With dead ends: 8392 [2019-11-15 21:28:56,723 INFO L226 Difference]: Without dead ends: 4870 [2019-11-15 21:28:56,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-15 21:28:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2019-11-15 21:28:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-11-15 21:28:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2019-11-15 21:28:56,865 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2019-11-15 21:28:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:56,866 INFO L462 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2019-11-15 21:28:56,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2019-11-15 21:28:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:28:56,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:56,871 INFO L380 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] [2019-11-15 21:28:56,871 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2019-11-15 21:28:56,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:56,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902233172] [2019-11-15 21:28:56,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:56,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902233172] [2019-11-15 21:28:56,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:56,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:56,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579400542] [2019-11-15 21:28:56,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:56,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,894 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2019-11-15 21:28:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:56,966 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2019-11-15 21:28:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:56,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:28:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:56,975 INFO L225 Difference]: With dead ends: 7304 [2019-11-15 21:28:56,975 INFO L226 Difference]: Without dead ends: 4934 [2019-11-15 21:28:56,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-11-15 21:28:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-11-15 21:28:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-11-15 21:28:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2019-11-15 21:28:57,098 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2019-11-15 21:28:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:57,099 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2019-11-15 21:28:57,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2019-11-15 21:28:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:28:57,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:57,104 INFO L380 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] [2019-11-15 21:28:57,104 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2019-11-15 21:28:57,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:57,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28792788] [2019-11-15 21:28:57,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:57,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:57,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:57,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28792788] [2019-11-15 21:28:57,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:57,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:57,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438187792] [2019-11-15 21:28:57,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:57,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:57,129 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2019-11-15 21:28:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:57,225 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2019-11-15 21:28:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:57,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:28:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:57,242 INFO L225 Difference]: With dead ends: 8712 [2019-11-15 21:28:57,242 INFO L226 Difference]: Without dead ends: 8710 [2019-11-15 21:28:57,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-11-15 21:28:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2019-11-15 21:28:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2019-11-15 21:28:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2019-11-15 21:28:57,457 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2019-11-15 21:28:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:57,457 INFO L462 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2019-11-15 21:28:57,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2019-11-15 21:28:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:28:57,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:57,470 INFO L380 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] [2019-11-15 21:28:57,470 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2019-11-15 21:28:57,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:57,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633177973] [2019-11-15 21:28:57,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:57,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:57,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:57,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633177973] [2019-11-15 21:28:57,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:57,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:57,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262093423] [2019-11-15 21:28:57,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:57,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:57,495 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2019-11-15 21:28:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:57,649 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2019-11-15 21:28:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:57,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:28:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:57,666 INFO L225 Difference]: With dead ends: 16648 [2019-11-15 21:28:57,666 INFO L226 Difference]: Without dead ends: 9606 [2019-11-15 21:28:57,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-11-15 21:28:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2019-11-15 21:28:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-11-15 21:28:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2019-11-15 21:28:57,906 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2019-11-15 21:28:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:57,906 INFO L462 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2019-11-15 21:28:57,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2019-11-15 21:28:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:28:57,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:57,916 INFO L380 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] [2019-11-15 21:28:57,917 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2019-11-15 21:28:57,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:57,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107435232] [2019-11-15 21:28:57,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:57,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:57,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:57,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107435232] [2019-11-15 21:28:57,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:57,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:57,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816919277] [2019-11-15 21:28:57,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:57,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:57,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:57,933 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2019-11-15 21:28:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:58,035 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2019-11-15 21:28:58,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:58,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:28:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:58,054 INFO L225 Difference]: With dead ends: 14408 [2019-11-15 21:28:58,054 INFO L226 Difference]: Without dead ends: 9734 [2019-11-15 21:28:58,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-11-15 21:28:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2019-11-15 21:28:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-11-15 21:28:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2019-11-15 21:28:58,288 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2019-11-15 21:28:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:58,288 INFO L462 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2019-11-15 21:28:58,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2019-11-15 21:28:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:28:58,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:58,298 INFO L380 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] [2019-11-15 21:28:58,299 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2019-11-15 21:28:58,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:58,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18846548] [2019-11-15 21:28:58,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:58,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:58,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:58,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18846548] [2019-11-15 21:28:58,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:58,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:58,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057331520] [2019-11-15 21:28:58,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:58,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:58,315 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2019-11-15 21:28:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:58,481 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2019-11-15 21:28:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:58,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:28:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:58,512 INFO L225 Difference]: With dead ends: 16904 [2019-11-15 21:28:58,512 INFO L226 Difference]: Without dead ends: 16902 [2019-11-15 21:28:58,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-11-15 21:28:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2019-11-15 21:28:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-15 21:28:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2019-11-15 21:28:58,987 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2019-11-15 21:28:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:58,987 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2019-11-15 21:28:58,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2019-11-15 21:28:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:28:59,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:59,005 INFO L380 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] [2019-11-15 21:28:59,005 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2019-11-15 21:28:59,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:59,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421495816] [2019-11-15 21:28:59,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:59,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:59,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:59,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421495816] [2019-11-15 21:28:59,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:59,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:59,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134282067] [2019-11-15 21:28:59,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:59,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:59,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:59,025 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2019-11-15 21:28:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:59,223 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2019-11-15 21:28:59,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:59,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:28:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:59,255 INFO L225 Difference]: With dead ends: 33032 [2019-11-15 21:28:59,255 INFO L226 Difference]: Without dead ends: 18950 [2019-11-15 21:28:59,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2019-11-15 21:28:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2019-11-15 21:28:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-11-15 21:28:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2019-11-15 21:28:59,648 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2019-11-15 21:28:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:59,648 INFO L462 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2019-11-15 21:28:59,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2019-11-15 21:28:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:28:59,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:59,667 INFO L380 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] [2019-11-15 21:28:59,667 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2019-11-15 21:28:59,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:59,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506785256] [2019-11-15 21:28:59,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:59,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:59,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:59,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506785256] [2019-11-15 21:28:59,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:59,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:59,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498308874] [2019-11-15 21:28:59,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:59,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:59,684 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2019-11-15 21:28:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:59,875 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2019-11-15 21:28:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:59,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 21:28:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:59,910 INFO L225 Difference]: With dead ends: 28424 [2019-11-15 21:28:59,910 INFO L226 Difference]: Without dead ends: 19206 [2019-11-15 21:28:59,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:28:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-11-15 21:29:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2019-11-15 21:29:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-15 21:29:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2019-11-15 21:29:00,454 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2019-11-15 21:29:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:00,455 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2019-11-15 21:29:00,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2019-11-15 21:29:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:29:00,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:00,473 INFO L380 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] [2019-11-15 21:29:00,473 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:00,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2019-11-15 21:29:00,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:00,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494804067] [2019-11-15 21:29:00,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:00,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:00,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:00,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494804067] [2019-11-15 21:29:00,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:00,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:00,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202004006] [2019-11-15 21:29:00,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:00,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:00,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:00,489 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2019-11-15 21:29:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:00,768 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2019-11-15 21:29:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 21:29:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:00,824 INFO L225 Difference]: With dead ends: 32776 [2019-11-15 21:29:00,824 INFO L226 Difference]: Without dead ends: 32774 [2019-11-15 21:29:00,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2019-11-15 21:29:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2019-11-15 21:29:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2019-11-15 21:29:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2019-11-15 21:29:01,334 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2019-11-15 21:29:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:01,334 INFO L462 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2019-11-15 21:29:01,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2019-11-15 21:29:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:29:01,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:01,364 INFO L380 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] [2019-11-15 21:29:01,364 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2019-11-15 21:29:01,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:01,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335746135] [2019-11-15 21:29:01,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:01,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:01,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:01,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335746135] [2019-11-15 21:29:01,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:01,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:01,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542425863] [2019-11-15 21:29:01,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:01,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:01,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:01,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:01,388 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2019-11-15 21:29:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:02,016 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2019-11-15 21:29:02,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:02,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 21:29:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:02,072 INFO L225 Difference]: With dead ends: 65544 [2019-11-15 21:29:02,072 INFO L226 Difference]: Without dead ends: 37382 [2019-11-15 21:29:02,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2019-11-15 21:29:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2019-11-15 21:29:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2019-11-15 21:29:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2019-11-15 21:29:02,785 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2019-11-15 21:29:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:02,786 INFO L462 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2019-11-15 21:29:02,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2019-11-15 21:29:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:29:02,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:02,812 INFO L380 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] [2019-11-15 21:29:02,812 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2019-11-15 21:29:02,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:02,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32720387] [2019-11-15 21:29:02,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:02,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:02,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:02,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32720387] [2019-11-15 21:29:02,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:02,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:02,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418449064] [2019-11-15 21:29:02,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:02,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:02,833 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2019-11-15 21:29:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:03,176 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2019-11-15 21:29:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:03,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 21:29:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:03,239 INFO L225 Difference]: With dead ends: 56072 [2019-11-15 21:29:03,240 INFO L226 Difference]: Without dead ends: 37894 [2019-11-15 21:29:03,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2019-11-15 21:29:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2019-11-15 21:29:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2019-11-15 21:29:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2019-11-15 21:29:04,225 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2019-11-15 21:29:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:04,225 INFO L462 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2019-11-15 21:29:04,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2019-11-15 21:29:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:29:04,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:04,251 INFO L380 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] [2019-11-15 21:29:04,252 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2019-11-15 21:29:04,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:04,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859503195] [2019-11-15 21:29:04,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:04,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:04,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:04,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859503195] [2019-11-15 21:29:04,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:04,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:04,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200879927] [2019-11-15 21:29:04,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:04,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:04,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:04,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:04,284 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2019-11-15 21:29:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:04,853 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2019-11-15 21:29:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:04,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 21:29:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:04,942 INFO L225 Difference]: With dead ends: 110600 [2019-11-15 21:29:04,942 INFO L226 Difference]: Without dead ends: 73734 [2019-11-15 21:29:04,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2019-11-15 21:29:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2019-11-15 21:29:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-11-15 21:29:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2019-11-15 21:29:06,743 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2019-11-15 21:29:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:06,743 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2019-11-15 21:29:06,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2019-11-15 21:29:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:29:06,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:06,781 INFO L380 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] [2019-11-15 21:29:06,781 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2019-11-15 21:29:06,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:06,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017485340] [2019-11-15 21:29:06,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:06,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:06,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:06,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017485340] [2019-11-15 21:29:06,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:06,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:06,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808128829] [2019-11-15 21:29:06,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:06,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:06,799 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2019-11-15 21:29:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:07,438 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2019-11-15 21:29:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:07,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 21:29:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:07,534 INFO L225 Difference]: With dead ends: 79880 [2019-11-15 21:29:07,534 INFO L226 Difference]: Without dead ends: 79878 [2019-11-15 21:29:07,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-11-15 21:29:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2019-11-15 21:29:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-11-15 21:29:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2019-11-15 21:29:08,955 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2019-11-15 21:29:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:08,955 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2019-11-15 21:29:08,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2019-11-15 21:29:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:29:08,992 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:08,993 INFO L380 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] [2019-11-15 21:29:08,993 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2019-11-15 21:29:08,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:08,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855314785] [2019-11-15 21:29:08,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:08,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:08,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:09,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855314785] [2019-11-15 21:29:09,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:09,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:09,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090781349] [2019-11-15 21:29:09,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:09,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:09,011 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2019-11-15 21:29:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:09,645 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2019-11-15 21:29:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:09,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 21:29:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:09,757 INFO L225 Difference]: With dead ends: 121864 [2019-11-15 21:29:09,757 INFO L226 Difference]: Without dead ends: 121862 [2019-11-15 21:29:09,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2019-11-15 21:29:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2019-11-15 21:29:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2019-11-15 21:29:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2019-11-15 21:29:11,431 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2019-11-15 21:29:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:11,431 INFO L462 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2019-11-15 21:29:11,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2019-11-15 21:29:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:29:11,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:11,483 INFO L380 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] [2019-11-15 21:29:11,483 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2019-11-15 21:29:11,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:11,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962355759] [2019-11-15 21:29:11,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:11,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:11,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:11,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962355759] [2019-11-15 21:29:11,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:11,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:11,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269263217] [2019-11-15 21:29:11,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:11,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:11,502 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2019-11-15 21:29:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:12,347 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2019-11-15 21:29:12,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:12,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 21:29:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:12,459 INFO L225 Difference]: With dead ends: 257032 [2019-11-15 21:29:12,460 INFO L226 Difference]: Without dead ends: 144390 [2019-11-15 21:29:13,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2019-11-15 21:29:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2019-11-15 21:29:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2019-11-15 21:29:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2019-11-15 21:29:14,444 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2019-11-15 21:29:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:14,445 INFO L462 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2019-11-15 21:29:14,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2019-11-15 21:29:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:29:14,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:14,499 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:14,500 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2019-11-15 21:29:14,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:14,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91225427] [2019-11-15 21:29:14,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:14,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:14,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:14,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91225427] [2019-11-15 21:29:14,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:14,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:14,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654318895] [2019-11-15 21:29:14,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:14,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:14,519 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2019-11-15 21:29:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:15,844 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2019-11-15 21:29:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:15,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 21:29:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:15,991 INFO L225 Difference]: With dead ends: 218120 [2019-11-15 21:29:15,991 INFO L226 Difference]: Without dead ends: 147462 [2019-11-15 21:29:16,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2019-11-15 21:29:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2019-11-15 21:29:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2019-11-15 21:29:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2019-11-15 21:29:17,505 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2019-11-15 21:29:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:17,505 INFO L462 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2019-11-15 21:29:17,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2019-11-15 21:29:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:29:17,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:17,565 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:17,565 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2019-11-15 21:29:17,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:17,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129910852] [2019-11-15 21:29:17,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:17,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:17,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:17,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129910852] [2019-11-15 21:29:17,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:17,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:17,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875083028] [2019-11-15 21:29:17,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:17,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:17,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:17,592 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2019-11-15 21:29:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:19,193 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2019-11-15 21:29:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:19,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 21:29:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:19,398 INFO L225 Difference]: With dead ends: 237574 [2019-11-15 21:29:19,398 INFO L226 Difference]: Without dead ends: 237572 [2019-11-15 21:29:19,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2019-11-15 21:29:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2019-11-15 21:29:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2019-11-15 21:29:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2019-11-15 21:29:21,762 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2019-11-15 21:29:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:21,762 INFO L462 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2019-11-15 21:29:21,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2019-11-15 21:29:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:29:21,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:21,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:21,924 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2019-11-15 21:29:21,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:21,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876432212] [2019-11-15 21:29:21,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:21,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:21,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:21,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876432212] [2019-11-15 21:29:21,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:21,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:21,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83016173] [2019-11-15 21:29:21,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:21,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:21,946 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2019-11-15 21:29:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:24,324 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2019-11-15 21:29:24,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:24,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 21:29:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:24,325 INFO L225 Difference]: With dead ends: 512004 [2019-11-15 21:29:24,325 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:29:24,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:29:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:29:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:29:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:29:24,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-15 21:29:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:24,415 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:29:24,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:29:24,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:29:24,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:29:24,445 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,446 INFO L446 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 21:29:24,447 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,448 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-15 21:29:24,449 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,449 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:29:24,450 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-11-15 21:29:24,450 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,450 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,450 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-11-15 21:29:24,450 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,450 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:29:24,451 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,451 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-11-15 21:29:24,451 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:29:24,451 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,452 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,452 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-11-15 21:29:24,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:29:24 BoogieIcfgContainer [2019-11-15 21:29:24,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:29:24,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:29:24,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:29:24,461 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:29:24,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:28:54" (3/4) ... [2019-11-15 21:29:24,464 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:29:24,478 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 21:29:24,479 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:29:24,554 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c18326ee-01fb-4384-a709-3bb1e14189d7/bin/uautomizer/witness.graphml [2019-11-15 21:29:24,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:29:24,557 INFO L168 Benchmark]: Toolchain (without parser) took 31367.86 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 951.4 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:29:24,557 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:24,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -201.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:24,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:24,558 INFO L168 Benchmark]: Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:24,559 INFO L168 Benchmark]: RCFGBuilder took 487.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:24,559 INFO L168 Benchmark]: TraceAbstraction took 30414.36 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -991.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:29:24,560 INFO L168 Benchmark]: Witness Printer took 94.26 ms. Allocated memory is still 4.5 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:24,562 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -201.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30414.36 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -991.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 94.26 ms. Allocated memory is still 4.5 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Result: SAFE, OverallTime: 30.3s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...