./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10.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/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/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 0f7b0b589689413087c164ce10eb80c902ee4046 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:51,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:51,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:51,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:51,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:51,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:51,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:51,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:51,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:51,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:51,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:51,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:51,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:51,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:51,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:51,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:51,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:51,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:51,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:51,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:51,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:51,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:51,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:51,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:51,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:51,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:51,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:51,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:51,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:51,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:51,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:51,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:51,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:51,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:51,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:51,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:51,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:51,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:51,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:51,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:51,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:51,567 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:00:51,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:51,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:51,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:51,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:51,578 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:51,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:51,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:51,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:51,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:51,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:51,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:00:51,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:00:51,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:00:51,580 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:51,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:51,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:51,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:00:51,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:51,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:51,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:00:51,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:00:51,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:51,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:51,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:00:51,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:00:51,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:51,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:00:51,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:00:51,583 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/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-10-22 09:00:51,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:51,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:51,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:51,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:51,621 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:51,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_10.c [2019-10-22 09:00:51,682 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/data/dc228a20c/d54ca2e0d28245e698eb8fcf7b7d7330/FLAG7346b693d [2019-10-22 09:00:52,039 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:52,040 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/sv-benchmarks/c/locks/test_locks_10.c [2019-10-22 09:00:52,046 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/data/dc228a20c/d54ca2e0d28245e698eb8fcf7b7d7330/FLAG7346b693d [2019-10-22 09:00:52,055 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/data/dc228a20c/d54ca2e0d28245e698eb8fcf7b7d7330 [2019-10-22 09:00:52,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:52,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:52,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:52,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:52,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:52,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a48f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52, skipping insertion in model container [2019-10-22 09:00:52,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,072 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:52,091 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:52,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:52,266 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:52,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:52,363 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:52,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52 WrapperNode [2019-10-22 09:00:52,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:52,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:52,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:52,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:52,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:52,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:52,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:52,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:52,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... [2019-10-22 09:00:52,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:52,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:52,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:52,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:52,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/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-10-22 09:00:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:52,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:52,657 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:00:52,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:52 BoogieIcfgContainer [2019-10-22 09:00:52,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:52,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:00:52,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:00:52,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:00:52,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:00:52" (1/3) ... [2019-10-22 09:00:52,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed3f8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:52, skipping insertion in model container [2019-10-22 09:00:52,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:52" (2/3) ... [2019-10-22 09:00:52,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed3f8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:52, skipping insertion in model container [2019-10-22 09:00:52,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:52" (3/3) ... [2019-10-22 09:00:52,664 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-22 09:00:52,671 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:00:52,677 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:00:52,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:00:52,734 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:00:52,734 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:00:52,734 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:00:52,734 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:52,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:52,735 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:00:52,735 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:52,735 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:00:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-10-22 09:00:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:00:52,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:52,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:52,772 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2019-10-22 09:00:52,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:52,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399011360] [2019-10-22 09:00:52,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:52,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399011360] [2019-10-22 09:00:52,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:52,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:52,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178509938] [2019-10-22 09:00:52,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:52,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:52,970 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-10-22 09:00:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,005 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2019-10-22 09:00:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 09:00:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,021 INFO L225 Difference]: With dead ends: 82 [2019-10-22 09:00:53,021 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 09:00:53,024 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-10-22 09:00:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 09:00:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-10-22 09:00:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 09:00:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2019-10-22 09:00:53,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2019-10-22 09:00:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,058 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2019-10-22 09:00:53,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2019-10-22 09:00:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:00:53,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,060 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2019-10-22 09:00:53,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447333679] [2019-10-22 09:00:53,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447333679] [2019-10-22 09:00:53,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153459425] [2019-10-22 09:00:53,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,106 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2019-10-22 09:00:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,154 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2019-10-22 09:00:53,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 09:00:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,156 INFO L225 Difference]: With dead ends: 113 [2019-10-22 09:00:53,156 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 09:00:53,160 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-10-22 09:00:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 09:00:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-22 09:00:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 09:00:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-10-22 09:00:53,168 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2019-10-22 09:00:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,169 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-10-22 09:00:53,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-10-22 09:00:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:00:53,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,170 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2019-10-22 09:00:53,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235311215] [2019-10-22 09:00:53,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235311215] [2019-10-22 09:00:53,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129613690] [2019-10-22 09:00:53,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,239 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-10-22 09:00:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,274 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-10-22 09:00:53,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:00:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,276 INFO L225 Difference]: With dead ends: 104 [2019-10-22 09:00:53,276 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 09:00:53,276 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-10-22 09:00:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 09:00:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-10-22 09:00:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 09:00:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2019-10-22 09:00:53,282 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2019-10-22 09:00:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,283 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2019-10-22 09:00:53,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2019-10-22 09:00:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:00:53,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,284 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2019-10-22 09:00:53,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090916617] [2019-10-22 09:00:53,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090916617] [2019-10-22 09:00:53,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983964006] [2019-10-22 09:00:53,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,314 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2019-10-22 09:00:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,329 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2019-10-22 09:00:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:00:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,330 INFO L225 Difference]: With dead ends: 132 [2019-10-22 09:00:53,330 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 09:00:53,331 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-10-22 09:00:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 09:00:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-10-22 09:00:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 09:00:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2019-10-22 09:00:53,338 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2019-10-22 09:00:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,339 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2019-10-22 09:00:53,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2019-10-22 09:00:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:00:53,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2019-10-22 09:00:53,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765411302] [2019-10-22 09:00:53,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,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-10-22 09:00:53,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765411302] [2019-10-22 09:00:53,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626002037] [2019-10-22 09:00:53,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,398 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2019-10-22 09:00:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,414 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2019-10-22 09:00:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 09:00:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,415 INFO L225 Difference]: With dead ends: 220 [2019-10-22 09:00:53,415 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 09:00:53,416 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-10-22 09:00:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 09:00:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-10-22 09:00:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 09:00:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2019-10-22 09:00:53,424 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2019-10-22 09:00:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,424 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2019-10-22 09:00:53,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2019-10-22 09:00:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 09:00:53,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2019-10-22 09:00:53,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143339611] [2019-10-22 09:00:53,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143339611] [2019-10-22 09:00:53,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750827331] [2019-10-22 09:00:53,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,450 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2019-10-22 09:00:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,463 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2019-10-22 09:00:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 09:00:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,464 INFO L225 Difference]: With dead ends: 197 [2019-10-22 09:00:53,464 INFO L226 Difference]: Without dead ends: 134 [2019-10-22 09:00:53,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-10-22 09:00:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-22 09:00:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-10-22 09:00:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 09:00:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2019-10-22 09:00:53,480 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2019-10-22 09:00:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,480 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2019-10-22 09:00:53,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2019-10-22 09:00:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 09:00:53,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,482 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2019-10-22 09:00:53,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208412528] [2019-10-22 09:00:53,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208412528] [2019-10-22 09:00:53,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483976611] [2019-10-22 09:00:53,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,533 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2019-10-22 09:00:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,565 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2019-10-22 09:00:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 09:00:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,567 INFO L225 Difference]: With dead ends: 380 [2019-10-22 09:00:53,567 INFO L226 Difference]: Without dead ends: 254 [2019-10-22 09:00:53,567 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-10-22 09:00:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-22 09:00:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-10-22 09:00:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:00:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2019-10-22 09:00:53,581 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2019-10-22 09:00:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,581 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2019-10-22 09:00:53,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2019-10-22 09:00:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 09:00:53,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,582 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,585 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2019-10-22 09:00:53,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171632515] [2019-10-22 09:00:53,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171632515] [2019-10-22 09:00:53,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412326093] [2019-10-22 09:00:53,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,626 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2019-10-22 09:00:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,652 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2019-10-22 09:00:53,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 09:00:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,653 INFO L225 Difference]: With dead ends: 320 [2019-10-22 09:00:53,653 INFO L226 Difference]: Without dead ends: 318 [2019-10-22 09:00:53,654 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-10-22 09:00:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-22 09:00:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2019-10-22 09:00:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:00:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2019-10-22 09:00:53,675 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2019-10-22 09:00:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,675 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2019-10-22 09:00:53,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2019-10-22 09:00:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 09:00:53,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,677 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-10-22 09:00:53,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2019-10-22 09:00:53,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974016793] [2019-10-22 09:00:53,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974016793] [2019-10-22 09:00:53,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622346446] [2019-10-22 09:00:53,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,717 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2019-10-22 09:00:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,731 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2019-10-22 09:00:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 09:00:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,733 INFO L225 Difference]: With dead ends: 468 [2019-10-22 09:00:53,733 INFO L226 Difference]: Without dead ends: 466 [2019-10-22 09:00:53,733 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-10-22 09:00:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-22 09:00:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2019-10-22 09:00:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-22 09:00:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2019-10-22 09:00:53,744 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2019-10-22 09:00:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,745 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2019-10-22 09:00:53,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2019-10-22 09:00:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 09:00:53,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,746 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-10-22 09:00:53,746 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2019-10-22 09:00:53,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788382669] [2019-10-22 09:00:53,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788382669] [2019-10-22 09:00:53,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215041857] [2019-10-22 09:00:53,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,765 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2019-10-22 09:00:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,793 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2019-10-22 09:00:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 09:00:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,795 INFO L225 Difference]: With dead ends: 836 [2019-10-22 09:00:53,796 INFO L226 Difference]: Without dead ends: 490 [2019-10-22 09:00:53,796 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-10-22 09:00:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-22 09:00:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-10-22 09:00:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-22 09:00:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-10-22 09:00:53,816 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2019-10-22 09:00:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,817 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-10-22 09:00:53,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-10-22 09:00:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:00:53,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,819 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-10-22 09:00:53,820 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2019-10-22 09:00:53,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546338024] [2019-10-22 09:00:53,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546338024] [2019-10-22 09:00:53,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650852886] [2019-10-22 09:00:53,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,844 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-10-22 09:00:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,869 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2019-10-22 09:00:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:00:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,871 INFO L225 Difference]: With dead ends: 740 [2019-10-22 09:00:53,871 INFO L226 Difference]: Without dead ends: 502 [2019-10-22 09:00:53,871 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-10-22 09:00:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-10-22 09:00:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-10-22 09:00:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-22 09:00:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2019-10-22 09:00:53,887 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2019-10-22 09:00:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,887 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2019-10-22 09:00:53,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2019-10-22 09:00:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:00:53,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,888 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-10-22 09:00:53,889 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2019-10-22 09:00:53,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782748052] [2019-10-22 09:00:53,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782748052] [2019-10-22 09:00:53,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815813338] [2019-10-22 09:00:53,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,920 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2019-10-22 09:00:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,941 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2019-10-22 09:00:53,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:53,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:00:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,944 INFO L225 Difference]: With dead ends: 904 [2019-10-22 09:00:53,945 INFO L226 Difference]: Without dead ends: 902 [2019-10-22 09:00:53,945 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-10-22 09:00:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-10-22 09:00:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2019-10-22 09:00:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-10-22 09:00:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2019-10-22 09:00:53,961 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2019-10-22 09:00:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:53,962 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2019-10-22 09:00:53,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2019-10-22 09:00:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:00:53,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:53,963 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-10-22 09:00:53,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2019-10-22 09:00:53,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340026324] [2019-10-22 09:00:53,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340026324] [2019-10-22 09:00:53,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110866535] [2019-10-22 09:00:53,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:53,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:53,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:53,987 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2019-10-22 09:00:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,027 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2019-10-22 09:00:54,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:00:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,030 INFO L225 Difference]: With dead ends: 1656 [2019-10-22 09:00:54,031 INFO L226 Difference]: Without dead ends: 966 [2019-10-22 09:00:54,032 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-10-22 09:00:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-10-22 09:00:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-10-22 09:00:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-10-22 09:00:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2019-10-22 09:00:54,064 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2019-10-22 09:00:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,064 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2019-10-22 09:00:54,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2019-10-22 09:00:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:00:54,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,066 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-10-22 09:00:54,066 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2019-10-22 09:00:54,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668271264] [2019-10-22 09:00:54,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668271264] [2019-10-22 09:00:54,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320804468] [2019-10-22 09:00:54,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,089 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2019-10-22 09:00:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,115 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2019-10-22 09:00:54,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 09:00:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,118 INFO L225 Difference]: With dead ends: 1448 [2019-10-22 09:00:54,118 INFO L226 Difference]: Without dead ends: 982 [2019-10-22 09:00:54,119 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-10-22 09:00:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-10-22 09:00:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-10-22 09:00:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-10-22 09:00:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2019-10-22 09:00:54,145 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2019-10-22 09:00:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,145 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2019-10-22 09:00:54,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2019-10-22 09:00:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:00:54,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,147 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-10-22 09:00:54,147 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2019-10-22 09:00:54,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086964805] [2019-10-22 09:00:54,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086964805] [2019-10-22 09:00:54,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772448576] [2019-10-22 09:00:54,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,166 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2019-10-22 09:00:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,195 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2019-10-22 09:00:54,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 09:00:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,201 INFO L225 Difference]: With dead ends: 1736 [2019-10-22 09:00:54,201 INFO L226 Difference]: Without dead ends: 1734 [2019-10-22 09:00:54,202 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-10-22 09:00:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-22 09:00:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2019-10-22 09:00:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-10-22 09:00:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2019-10-22 09:00:54,241 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2019-10-22 09:00:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,242 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2019-10-22 09:00:54,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2019-10-22 09:00:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:00:54,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,244 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-10-22 09:00:54,244 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2019-10-22 09:00:54,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692950768] [2019-10-22 09:00:54,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692950768] [2019-10-22 09:00:54,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818584462] [2019-10-22 09:00:54,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,264 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2019-10-22 09:00:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,300 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2019-10-22 09:00:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 09:00:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,306 INFO L225 Difference]: With dead ends: 3272 [2019-10-22 09:00:54,307 INFO L226 Difference]: Without dead ends: 1894 [2019-10-22 09:00:54,308 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-10-22 09:00:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-10-22 09:00:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2019-10-22 09:00:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-10-22 09:00:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2019-10-22 09:00:54,358 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2019-10-22 09:00:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,358 INFO L462 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2019-10-22 09:00:54,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2019-10-22 09:00:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 09:00:54,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,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] [2019-10-22 09:00:54,360 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2019-10-22 09:00:54,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553461113] [2019-10-22 09:00:54,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553461113] [2019-10-22 09:00:54,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293343993] [2019-10-22 09:00:54,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,380 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2019-10-22 09:00:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,413 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2019-10-22 09:00:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 09:00:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,419 INFO L225 Difference]: With dead ends: 2840 [2019-10-22 09:00:54,419 INFO L226 Difference]: Without dead ends: 1926 [2019-10-22 09:00:54,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-10-22 09:00:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-10-22 09:00:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-10-22 09:00:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-10-22 09:00:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2019-10-22 09:00:54,472 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2019-10-22 09:00:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,473 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2019-10-22 09:00:54,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2019-10-22 09:00:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 09:00:54,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,475 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-10-22 09:00:54,475 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2019-10-22 09:00:54,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386399426] [2019-10-22 09:00:54,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386399426] [2019-10-22 09:00:54,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249834337] [2019-10-22 09:00:54,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,497 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2019-10-22 09:00:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,566 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2019-10-22 09:00:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 09:00:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,576 INFO L225 Difference]: With dead ends: 3336 [2019-10-22 09:00:54,576 INFO L226 Difference]: Without dead ends: 3334 [2019-10-22 09:00:54,576 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-10-22 09:00:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-10-22 09:00:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2019-10-22 09:00:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-10-22 09:00:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2019-10-22 09:00:54,640 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2019-10-22 09:00:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,640 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2019-10-22 09:00:54,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2019-10-22 09:00:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 09:00:54,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,643 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-10-22 09:00:54,643 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2019-10-22 09:00:54,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394557857] [2019-10-22 09:00:54,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394557857] [2019-10-22 09:00:54,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924765106] [2019-10-22 09:00:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,662 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2019-10-22 09:00:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,719 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2019-10-22 09:00:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 09:00:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,730 INFO L225 Difference]: With dead ends: 6472 [2019-10-22 09:00:54,730 INFO L226 Difference]: Without dead ends: 3718 [2019-10-22 09:00:54,732 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-10-22 09:00:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-10-22 09:00:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2019-10-22 09:00:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2019-10-22 09:00:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2019-10-22 09:00:54,816 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2019-10-22 09:00:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,816 INFO L462 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2019-10-22 09:00:54,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2019-10-22 09:00:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:00:54,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,819 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-10-22 09:00:54,820 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2019-10-22 09:00:54,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145166335] [2019-10-22 09:00:54,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145166335] [2019-10-22 09:00:54,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:54,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155584324] [2019-10-22 09:00:54,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:54,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,839 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2019-10-22 09:00:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,892 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2019-10-22 09:00:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:00:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:54,902 INFO L225 Difference]: With dead ends: 5576 [2019-10-22 09:00:54,902 INFO L226 Difference]: Without dead ends: 3782 [2019-10-22 09:00:54,904 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-10-22 09:00:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-10-22 09:00:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2019-10-22 09:00:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-10-22 09:00:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2019-10-22 09:00:55,001 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2019-10-22 09:00:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:55,001 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2019-10-22 09:00:55,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2019-10-22 09:00:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:00:55,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:55,004 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-10-22 09:00:55,004 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2019-10-22 09:00:55,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447005503] [2019-10-22 09:00:55,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:55,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447005503] [2019-10-22 09:00:55,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:55,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:55,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703023459] [2019-10-22 09:00:55,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:55,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:55,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:55,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:55,027 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2019-10-22 09:00:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:55,109 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2019-10-22 09:00:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:55,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:00:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:55,135 INFO L225 Difference]: With dead ends: 6408 [2019-10-22 09:00:55,135 INFO L226 Difference]: Without dead ends: 6406 [2019-10-22 09:00:55,142 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-10-22 09:00:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2019-10-22 09:00:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2019-10-22 09:00:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-10-22 09:00:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2019-10-22 09:00:55,267 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2019-10-22 09:00:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:55,268 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2019-10-22 09:00:55,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2019-10-22 09:00:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:00:55,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:55,273 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-10-22 09:00:55,273 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2019-10-22 09:00:55,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168759204] [2019-10-22 09:00:55,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:55,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168759204] [2019-10-22 09:00:55,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:55,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:55,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511173879] [2019-10-22 09:00:55,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:55,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:55,294 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2019-10-22 09:00:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:55,395 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2019-10-22 09:00:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:55,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:00:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:55,408 INFO L225 Difference]: With dead ends: 12808 [2019-10-22 09:00:55,408 INFO L226 Difference]: Without dead ends: 7302 [2019-10-22 09:00:55,413 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-10-22 09:00:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-10-22 09:00:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2019-10-22 09:00:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2019-10-22 09:00:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2019-10-22 09:00:55,616 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2019-10-22 09:00:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:55,617 INFO L462 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2019-10-22 09:00:55,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2019-10-22 09:00:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 09:00:55,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:55,624 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-10-22 09:00:55,625 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2019-10-22 09:00:55,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432900504] [2019-10-22 09:00:55,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:55,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432900504] [2019-10-22 09:00:55,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:55,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:55,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554561469] [2019-10-22 09:00:55,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:55,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:55,645 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2019-10-22 09:00:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:55,778 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2019-10-22 09:00:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:55,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 09:00:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:55,789 INFO L225 Difference]: With dead ends: 10952 [2019-10-22 09:00:55,789 INFO L226 Difference]: Without dead ends: 7430 [2019-10-22 09:00:55,793 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-10-22 09:00:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2019-10-22 09:00:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2019-10-22 09:00:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2019-10-22 09:00:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2019-10-22 09:00:55,963 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2019-10-22 09:00:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:55,964 INFO L462 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2019-10-22 09:00:55,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2019-10-22 09:00:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 09:00:55,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:55,970 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-10-22 09:00:55,970 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2019-10-22 09:00:55,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555573686] [2019-10-22 09:00:55,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:55,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555573686] [2019-10-22 09:00:55,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:55,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:55,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666553632] [2019-10-22 09:00:55,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:55,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:55,989 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2019-10-22 09:00:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:56,146 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2019-10-22 09:00:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:56,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 09:00:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:56,167 INFO L225 Difference]: With dead ends: 12296 [2019-10-22 09:00:56,168 INFO L226 Difference]: Without dead ends: 12294 [2019-10-22 09:00:56,171 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-10-22 09:00:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-10-22 09:00:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2019-10-22 09:00:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-10-22 09:00:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2019-10-22 09:00:56,414 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2019-10-22 09:00:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:56,414 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2019-10-22 09:00:56,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2019-10-22 09:00:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 09:00:56,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:56,426 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-10-22 09:00:56,426 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:56,426 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2019-10-22 09:00:56,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:56,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112953980] [2019-10-22 09:00:56,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:56,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:56,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:56,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112953980] [2019-10-22 09:00:56,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:56,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:56,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306594782] [2019-10-22 09:00:56,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:56,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:56,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:56,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:56,440 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2019-10-22 09:00:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:56,623 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2019-10-22 09:00:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:56,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 09:00:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:56,645 INFO L225 Difference]: With dead ends: 25352 [2019-10-22 09:00:56,646 INFO L226 Difference]: Without dead ends: 14342 [2019-10-22 09:00:56,656 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-10-22 09:00:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-10-22 09:00:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2019-10-22 09:00:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-10-22 09:00:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2019-10-22 09:00:57,104 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2019-10-22 09:00:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:57,104 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2019-10-22 09:00:57,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2019-10-22 09:00:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:00:57,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:57,117 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-10-22 09:00:57,117 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2019-10-22 09:00:57,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585068466] [2019-10-22 09:00:57,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:57,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585068466] [2019-10-22 09:00:57,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:57,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162221835] [2019-10-22 09:00:57,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:57,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,138 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2019-10-22 09:00:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:57,323 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2019-10-22 09:00:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:57,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:00:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:57,350 INFO L225 Difference]: With dead ends: 21512 [2019-10-22 09:00:57,350 INFO L226 Difference]: Without dead ends: 14598 [2019-10-22 09:00:57,358 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-10-22 09:00:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-10-22 09:00:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2019-10-22 09:00:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2019-10-22 09:00:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2019-10-22 09:00:57,723 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2019-10-22 09:00:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:57,723 INFO L462 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2019-10-22 09:00:57,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2019-10-22 09:00:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:00:57,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:57,738 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-10-22 09:00:57,738 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2019-10-22 09:00:57,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122871585] [2019-10-22 09:00:57,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:57,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122871585] [2019-10-22 09:00:57,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:57,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441021225] [2019-10-22 09:00:57,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:57,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,759 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2019-10-22 09:00:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,060 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2019-10-22 09:00:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:58,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:00:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,098 INFO L225 Difference]: With dead ends: 23558 [2019-10-22 09:00:58,098 INFO L226 Difference]: Without dead ends: 23556 [2019-10-22 09:00:58,104 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-10-22 09:00:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2019-10-22 09:00:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2019-10-22 09:00:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-10-22 09:00:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2019-10-22 09:00:58,663 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2019-10-22 09:00:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:58,663 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2019-10-22 09:00:58,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2019-10-22 09:00:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:00:58,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:58,687 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-10-22 09:00:58,688 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2019-10-22 09:00:58,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083207263] [2019-10-22 09:00:58,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:58,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083207263] [2019-10-22 09:00:58,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:58,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067938438] [2019-10-22 09:00:58,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:58,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,701 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2019-10-22 09:00:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,071 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2019-10-22 09:00:59,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:59,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:00:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:59,072 INFO L225 Difference]: With dead ends: 50180 [2019-10-22 09:00:59,072 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:00:59,101 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-10-22 09:00:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:00:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:00:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:00:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:00:59,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-22 09:00:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:59,102 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:59,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:59,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:00:59,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:00:59,122 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,123 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-22 09:00:59,124 INFO L446 ceAbstractionStarter]: At program point L162(lines 4 163) the Hoare annotation is: true [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,124 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,125 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-22 09:00:59,125 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,125 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,125 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-22 09:00:59,126 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-22 09:00:59,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:00:59 BoogieIcfgContainer [2019-10-22 09:00:59,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:00:59,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:59,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:59,137 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:59,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:52" (3/4) ... [2019-10-22 09:00:59,142 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:00:59,153 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 09:00:59,155 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:00:59,199 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9910f038-f174-4911-9ce3-29fe3eeef5d8/bin/uautomizer/witness.graphml [2019-10-22 09:00:59,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:59,201 INFO L168 Benchmark]: Toolchain (without parser) took 7142.62 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.7 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 360.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,202 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:59,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,202 INFO L168 Benchmark]: Boogie Preprocessor took 18.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,202 INFO L168 Benchmark]: RCFGBuilder took 243.59 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,203 INFO L168 Benchmark]: TraceAbstraction took 6477.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 381.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,203 INFO L168 Benchmark]: Witness Printer took 62.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:59,204 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 243.59 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6477.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 381.4 MB. Max. memory is 11.5 GB. * Witness Printer took 62.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Result: SAFE, OverallTime: 6.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2276 SDtfs, 1149 SDslu, 1505 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 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.4s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...