./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/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 2022a41801b102600c4bc475b4f1b54abdd4798f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/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 2022a41801b102600c4bc475b4f1b54abdd4798f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:27:04,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:27:04,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:27:04,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:27:04,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:27:04,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:27:04,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:27:04,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:27:04,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:27:04,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:27:04,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:27:04,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:27:04,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:27:04,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:27:04,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:27:04,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:27:04,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:27:04,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:27:04,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:27:04,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:27:04,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:27:04,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:27:04,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:27:04,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:27:04,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:27:04,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:27:04,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:27:04,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:27:04,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:27:04,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:27:04,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:27:04,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:27:04,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:27:04,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:27:04,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:27:04,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:27:04,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:27:04,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:27:04,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:27:04,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:27:04,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:27:04,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:27:04,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:27:04,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:27:04,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:27:04,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:27:04,573 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:27:04,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:27:04,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:27:04,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:27:04,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:27:04,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:27:04,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:27:04,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:27:04,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:27:04,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:27:04,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:27:04,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:27:04,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:27:04,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:27:04,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:27:04,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:27:04,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:27:04,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:27:04,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:27:04,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:27:04,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:27:04,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:27:04,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:27:04,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:27:04,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/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 -> 2022a41801b102600c4bc475b4f1b54abdd4798f [2019-11-15 22:27:04,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:27:04,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:27:04,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:27:04,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:27:04,616 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:27:04,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-15 22:27:04,664 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/a3fe627b9/db090bec1f1040648f975e895a09f6ec/FLAGbd3bdaf10 [2019-11-15 22:27:05,226 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:27:05,227 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-15 22:27:05,247 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/a3fe627b9/db090bec1f1040648f975e895a09f6ec/FLAGbd3bdaf10 [2019-11-15 22:27:05,452 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/a3fe627b9/db090bec1f1040648f975e895a09f6ec [2019-11-15 22:27:05,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:27:05,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:27:05,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:27:05,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:27:05,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:27:05,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:27:05" (1/1) ... [2019-11-15 22:27:05,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636b271b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:05, skipping insertion in model container [2019-11-15 22:27:05,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:27:05" (1/1) ... [2019-11-15 22:27:05,469 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:27:05,544 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:27:06,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:27:06,024 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:27:06,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:27:06,215 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:27:06,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06 WrapperNode [2019-11-15 22:27:06,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:27:06,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:27:06,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:27:06,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:27:06,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:27:06,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:27:06,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:27:06,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:27:06,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... [2019-11-15 22:27:06,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:27:06,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:27:06,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:27:06,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:27:06,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:27:06,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:27:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:27:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:27:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:27:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:27:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:27:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:27:06,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:27:06,904 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:27:07,944 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:27:07,945 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:27:07,946 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:27:07,947 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:27:07,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:27:07 BoogieIcfgContainer [2019-11-15 22:27:07,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:27:07,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:27:07,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:27:07,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:27:07,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:27:05" (1/3) ... [2019-11-15 22:27:07,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7382eae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:27:07, skipping insertion in model container [2019-11-15 22:27:07,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:06" (2/3) ... [2019-11-15 22:27:07,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7382eae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:27:07, skipping insertion in model container [2019-11-15 22:27:07,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:27:07" (3/3) ... [2019-11-15 22:27:07,956 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2019-11-15 22:27:07,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:27:07,972 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:27:07,982 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:27:08,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:27:08,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:27:08,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:27:08,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:27:08,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:27:08,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:27:08,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:27:08,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:27:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 22:27:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:27:08,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:08,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:08,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-15 22:27:08,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:08,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105924628] [2019-11-15 22:27:08,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:08,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105924628] [2019-11-15 22:27:08,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:08,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:08,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140670010] [2019-11-15 22:27:08,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:08,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:08,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:08,325 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 22:27:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:08,873 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 22:27:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:08,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:27:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:08,886 INFO L225 Difference]: With dead ends: 323 [2019-11-15 22:27:08,886 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:27:08,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:27:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 22:27:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 22:27:08,938 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-15 22:27:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:08,938 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 22:27:08,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 22:27:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:27:08,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:08,940 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:08,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-11-15 22:27:08,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:08,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169397567] [2019-11-15 22:27:08,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:09,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169397567] [2019-11-15 22:27:09,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:09,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:09,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425516308] [2019-11-15 22:27:09,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:09,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:09,098 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 22:27:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:09,520 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 22:27:09,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:09,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 22:27:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:09,523 INFO L225 Difference]: With dead ends: 290 [2019-11-15 22:27:09,523 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:27:09,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:27:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 22:27:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 22:27:09,537 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-15 22:27:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:09,537 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 22:27:09,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 22:27:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:27:09,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:09,540 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:09,540 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:09,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-11-15 22:27:09,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:09,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532714923] [2019-11-15 22:27:09,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:09,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532714923] [2019-11-15 22:27:09,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:09,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:09,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744263049] [2019-11-15 22:27:09,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:09,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:09,656 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 22:27:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:10,053 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 22:27:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:10,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:27:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:10,057 INFO L225 Difference]: With dead ends: 289 [2019-11-15 22:27:10,057 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 22:27:10,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 22:27:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 22:27:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 22:27:10,076 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-15 22:27:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:10,077 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 22:27:10,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 22:27:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:27:10,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:10,084 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:10,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-11-15 22:27:10,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:10,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440203595] [2019-11-15 22:27:10,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:10,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440203595] [2019-11-15 22:27:10,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:10,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:10,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315747715] [2019-11-15 22:27:10,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:10,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:10,207 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 22:27:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:10,554 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 22:27:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:10,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:27:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:10,556 INFO L225 Difference]: With dead ends: 287 [2019-11-15 22:27:10,556 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:27:10,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:27:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 22:27:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 22:27:10,569 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-15 22:27:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:10,569 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 22:27:10,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 22:27:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:27:10,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:10,574 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:10,574 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-11-15 22:27:10,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:10,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059210614] [2019-11-15 22:27:10,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:10,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059210614] [2019-11-15 22:27:10,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:10,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:10,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405479817] [2019-11-15 22:27:10,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:10,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:10,671 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 22:27:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:10,967 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 22:27:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:10,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:27:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:10,970 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:27:10,970 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:27:10,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:27:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:27:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 22:27:10,978 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-15 22:27:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:10,979 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 22:27:10,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 22:27:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:27:10,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:10,980 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:10,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-11-15 22:27:10,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:10,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367053441] [2019-11-15 22:27:10,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:11,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367053441] [2019-11-15 22:27:11,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:11,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:11,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981458657] [2019-11-15 22:27:11,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:11,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:11,033 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 22:27:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:11,359 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 22:27:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:11,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:27:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:11,362 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:27:11,362 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:27:11,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:27:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:27:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 22:27:11,368 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-15 22:27:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:11,369 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 22:27:11,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 22:27:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:27:11,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:11,370 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:11,370 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-11-15 22:27:11,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:11,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911280807] [2019-11-15 22:27:11,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:11,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911280807] [2019-11-15 22:27:11,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:11,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:11,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932400801] [2019-11-15 22:27:11,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:11,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:11,426 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 22:27:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:11,733 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 22:27:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:11,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-15 22:27:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:11,734 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:27:11,735 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:27:11,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:27:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:27:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 22:27:11,740 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-15 22:27:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:11,741 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 22:27:11,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 22:27:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 22:27:11,742 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:11,742 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:11,742 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-11-15 22:27:11,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:11,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532785780] [2019-11-15 22:27:11,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:11,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532785780] [2019-11-15 22:27:11,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:11,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:11,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988535923] [2019-11-15 22:27:11,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:11,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:11,804 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 22:27:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:12,121 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 22:27:12,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:12,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 22:27:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:12,123 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:27:12,123 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:27:12,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:27:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:27:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 22:27:12,128 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-15 22:27:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:12,128 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 22:27:12,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 22:27:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:27:12,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:12,129 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:12,129 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:12,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:12,130 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-11-15 22:27:12,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:12,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348678834] [2019-11-15 22:27:12,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:12,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348678834] [2019-11-15 22:27:12,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:12,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:12,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372321304] [2019-11-15 22:27:12,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:12,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:12,207 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 22:27:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:12,463 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 22:27:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:12,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 22:27:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:12,464 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:27:12,465 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:27:12,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:27:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 22:27:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:27:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 22:27:12,470 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-15 22:27:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:12,470 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 22:27:12,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 22:27:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:27:12,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:12,471 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:12,471 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:12,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-11-15 22:27:12,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:12,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97352679] [2019-11-15 22:27:12,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:12,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97352679] [2019-11-15 22:27:12,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:12,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:12,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780853117] [2019-11-15 22:27:12,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:12,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:12,528 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 22:27:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:12,883 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 22:27:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:12,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 22:27:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:12,885 INFO L225 Difference]: With dead ends: 316 [2019-11-15 22:27:12,885 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 22:27:12,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 22:27:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 22:27:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 22:27:12,891 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-15 22:27:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:12,891 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 22:27:12,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 22:27:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:27:12,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:12,893 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:12,893 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:12,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-11-15 22:27:12,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:12,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916223426] [2019-11-15 22:27:12,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:12,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916223426] [2019-11-15 22:27:12,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:12,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:12,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728117049] [2019-11-15 22:27:12,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:12,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:12,953 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 22:27:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:13,300 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 22:27:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:13,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 22:27:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:13,302 INFO L225 Difference]: With dead ends: 338 [2019-11-15 22:27:13,303 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 22:27:13,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 22:27:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 22:27:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 22:27:13,308 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-15 22:27:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:13,309 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 22:27:13,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 22:27:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:27:13,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:13,310 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:13,310 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-11-15 22:27:13,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:13,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764698994] [2019-11-15 22:27:13,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:13,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764698994] [2019-11-15 22:27:13,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:13,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:13,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579976101] [2019-11-15 22:27:13,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:13,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:13,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:13,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:13,353 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 22:27:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:13,713 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 22:27:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:13,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:27:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:13,715 INFO L225 Difference]: With dead ends: 337 [2019-11-15 22:27:13,715 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 22:27:13,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 22:27:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 22:27:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 22:27:13,722 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-15 22:27:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:13,723 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 22:27:13,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 22:27:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:27:13,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:13,724 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:13,724 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-11-15 22:27:13,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:13,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673885468] [2019-11-15 22:27:13,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:13,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673885468] [2019-11-15 22:27:13,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:13,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:13,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342972826] [2019-11-15 22:27:13,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:13,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:13,794 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 22:27:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:14,153 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 22:27:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:14,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:27:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:14,155 INFO L225 Difference]: With dead ends: 335 [2019-11-15 22:27:14,155 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:27:14,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:27:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 22:27:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 22:27:14,161 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-15 22:27:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:14,162 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 22:27:14,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 22:27:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:27:14,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:14,164 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:14,164 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-11-15 22:27:14,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:14,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427665871] [2019-11-15 22:27:14,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:14,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:14,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:14,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427665871] [2019-11-15 22:27:14,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:14,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:14,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558909952] [2019-11-15 22:27:14,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:14,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:14,218 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 22:27:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:14,559 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 22:27:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:14,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:27:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:14,561 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:27:14,561 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:27:14,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:27:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:27:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 22:27:14,567 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-15 22:27:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:14,567 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 22:27:14,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 22:27:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:27:14,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:14,568 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:14,568 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-11-15 22:27:14,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:14,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662925390] [2019-11-15 22:27:14,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:14,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:14,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662925390] [2019-11-15 22:27:14,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:14,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:14,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145765191] [2019-11-15 22:27:14,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:14,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:14,658 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 22:27:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:15,026 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 22:27:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:15,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:27:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:15,027 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:27:15,028 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:27:15,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:27:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:27:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 22:27:15,034 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-15 22:27:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:15,034 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 22:27:15,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 22:27:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:27:15,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:15,035 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:15,036 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-11-15 22:27:15,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:15,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917672231] [2019-11-15 22:27:15,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:15,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917672231] [2019-11-15 22:27:15,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:15,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:15,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677127531] [2019-11-15 22:27:15,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:15,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:15,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:15,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:15,076 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 22:27:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:15,384 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 22:27:15,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:15,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:27:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:15,386 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:27:15,386 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:27:15,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:27:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:27:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 22:27:15,392 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-15 22:27:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:15,392 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 22:27:15,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 22:27:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:27:15,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:15,393 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:15,393 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-11-15 22:27:15,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:15,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088670614] [2019-11-15 22:27:15,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:15,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088670614] [2019-11-15 22:27:15,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:15,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:15,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765751127] [2019-11-15 22:27:15,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:15,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:15,445 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 22:27:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:15,774 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 22:27:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:15,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:27:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:15,775 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:27:15,775 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:27:15,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:27:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:27:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 22:27:15,781 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-15 22:27:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:15,781 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 22:27:15,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 22:27:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 22:27:15,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:15,782 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:15,782 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-11-15 22:27:15,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:15,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130839522] [2019-11-15 22:27:15,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:15,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130839522] [2019-11-15 22:27:15,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:15,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:15,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141354332] [2019-11-15 22:27:15,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:15,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:15,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:15,833 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 22:27:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:16,160 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 22:27:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:16,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 22:27:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:16,162 INFO L225 Difference]: With dead ends: 324 [2019-11-15 22:27:16,162 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 22:27:16,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 22:27:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 22:27:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:27:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 22:27:16,167 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-15 22:27:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:16,167 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 22:27:16,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 22:27:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:27:16,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:16,168 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:16,168 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-11-15 22:27:16,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:16,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921082612] [2019-11-15 22:27:16,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:16,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:16,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:16,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921082612] [2019-11-15 22:27:16,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:16,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:16,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215593488] [2019-11-15 22:27:16,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:16,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:16,259 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 22:27:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:16,660 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2019-11-15 22:27:16,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:16,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:27:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:16,662 INFO L225 Difference]: With dead ends: 422 [2019-11-15 22:27:16,662 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 22:27:16,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 22:27:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2019-11-15 22:27:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 22:27:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-15 22:27:16,669 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-15 22:27:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:16,669 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-15 22:27:16,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-15 22:27:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:27:16,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:16,670 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:16,670 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-11-15 22:27:16,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:16,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494818713] [2019-11-15 22:27:16,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:16,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:16,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:16,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494818713] [2019-11-15 22:27:16,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:16,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:16,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029983686] [2019-11-15 22:27:16,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:16,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:16,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:16,731 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-15 22:27:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:17,151 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-15 22:27:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:17,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:27:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:17,153 INFO L225 Difference]: With dead ends: 427 [2019-11-15 22:27:17,154 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 22:27:17,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 22:27:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-15 22:27:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 22:27:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-15 22:27:17,159 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-15 22:27:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:17,160 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-15 22:27:17,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-15 22:27:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:27:17,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:17,161 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:17,162 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-11-15 22:27:17,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:17,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894465494] [2019-11-15 22:27:17,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:17,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:17,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:17,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894465494] [2019-11-15 22:27:17,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:17,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:17,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947528973] [2019-11-15 22:27:17,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:17,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:17,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:17,237 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-15 22:27:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:17,628 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-15 22:27:17,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:17,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:27:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:17,630 INFO L225 Difference]: With dead ends: 492 [2019-11-15 22:27:17,630 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:27:17,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:27:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2019-11-15 22:27:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 22:27:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-15 22:27:17,639 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-15 22:27:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-15 22:27:17,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-15 22:27:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:27:17,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:17,641 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:17,641 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-11-15 22:27:17,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:17,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386042716] [2019-11-15 22:27:17,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:17,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:17,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:17,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386042716] [2019-11-15 22:27:17,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:17,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:17,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692234693] [2019-11-15 22:27:17,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:17,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:17,719 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-15 22:27:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:18,149 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2019-11-15 22:27:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:18,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-15 22:27:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:18,153 INFO L225 Difference]: With dead ends: 493 [2019-11-15 22:27:18,153 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:27:18,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:27:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2019-11-15 22:27:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 22:27:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-15 22:27:18,160 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-15 22:27:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:18,160 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-15 22:27:18,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-15 22:27:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 22:27:18,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:18,161 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:18,162 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-11-15 22:27:18,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:18,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797431918] [2019-11-15 22:27:18,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:18,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:18,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:18,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797431918] [2019-11-15 22:27:18,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:18,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:18,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399471487] [2019-11-15 22:27:18,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:18,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:18,240 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-15 22:27:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:18,683 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-15 22:27:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:18,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 22:27:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:18,686 INFO L225 Difference]: With dead ends: 497 [2019-11-15 22:27:18,686 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:27:18,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:27:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 22:27:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:27:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 22:27:18,692 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-15 22:27:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:18,693 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 22:27:18,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 22:27:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:27:18,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:18,694 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:18,695 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-11-15 22:27:18,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:18,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408682951] [2019-11-15 22:27:18,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:18,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:18,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:18,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408682951] [2019-11-15 22:27:18,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:18,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:18,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671968816] [2019-11-15 22:27:18,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:18,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:18,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:18,783 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 22:27:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:19,261 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-15 22:27:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:19,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:27:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:19,263 INFO L225 Difference]: With dead ends: 498 [2019-11-15 22:27:19,263 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:27:19,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:27:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 22:27:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:27:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 22:27:19,270 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-15 22:27:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:19,270 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 22:27:19,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 22:27:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:27:19,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:19,272 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:19,272 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-11-15 22:27:19,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:19,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142289303] [2019-11-15 22:27:19,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:19,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:19,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:19,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142289303] [2019-11-15 22:27:19,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:19,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:19,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621899481] [2019-11-15 22:27:19,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:19,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:19,333 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 22:27:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:19,677 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-15 22:27:19,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:19,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:27:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:19,679 INFO L225 Difference]: With dead ends: 475 [2019-11-15 22:27:19,679 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 22:27:19,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 22:27:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-15 22:27:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:27:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 22:27:19,685 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-15 22:27:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:19,685 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 22:27:19,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 22:27:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:27:19,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:19,687 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:19,687 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-11-15 22:27:19,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:19,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814602182] [2019-11-15 22:27:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:19,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814602182] [2019-11-15 22:27:19,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:19,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:19,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631801813] [2019-11-15 22:27:19,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:19,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:19,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:19,756 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 22:27:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:20,212 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-15 22:27:20,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:20,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:27:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:20,214 INFO L225 Difference]: With dead ends: 497 [2019-11-15 22:27:20,214 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:27:20,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:27:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-15 22:27:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:27:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 22:27:20,221 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-15 22:27:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:20,221 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 22:27:20,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 22:27:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:27:20,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:20,223 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:20,223 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-11-15 22:27:20,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:20,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804411008] [2019-11-15 22:27:20,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:20,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:20,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:20,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804411008] [2019-11-15 22:27:20,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:20,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:20,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314982987] [2019-11-15 22:27:20,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:20,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:20,280 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-15 22:27:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:20,698 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-15 22:27:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:20,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:27:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:20,700 INFO L225 Difference]: With dead ends: 495 [2019-11-15 22:27:20,700 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 22:27:20,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 22:27:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-15 22:27:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:27:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-15 22:27:20,706 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-15 22:27:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:20,706 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-15 22:27:20,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-15 22:27:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:27:20,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:20,707 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:20,707 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-11-15 22:27:20,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:20,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521848919] [2019-11-15 22:27:20,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:20,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:20,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521848919] [2019-11-15 22:27:20,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:20,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:20,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721274086] [2019-11-15 22:27:20,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:20,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:20,771 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-15 22:27:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:21,224 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-15 22:27:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:21,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:27:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:21,226 INFO L225 Difference]: With dead ends: 494 [2019-11-15 22:27:21,226 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 22:27:21,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 22:27:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-15 22:27:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:27:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-15 22:27:21,233 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-15 22:27:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:21,233 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-15 22:27:21,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-15 22:27:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:27:21,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:21,234 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:21,234 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-11-15 22:27:21,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:21,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805934160] [2019-11-15 22:27:21,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:21,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:21,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:27:21,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805934160] [2019-11-15 22:27:21,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:21,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:27:21,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987833112] [2019-11-15 22:27:21,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:27:21,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:27:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:21,309 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-15 22:27:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:21,824 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-15 22:27:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:27:21,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-15 22:27:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:21,827 INFO L225 Difference]: With dead ends: 470 [2019-11-15 22:27:21,827 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 22:27:21,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:27:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 22:27:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 22:27:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 22:27:21,833 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-15 22:27:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:21,833 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 22:27:21,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:27:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 22:27:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:27:21,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:21,835 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:21,835 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-11-15 22:27:21,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:21,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71487142] [2019-11-15 22:27:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:21,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:21,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:21,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71487142] [2019-11-15 22:27:21,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:21,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:21,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521872260] [2019-11-15 22:27:21,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:21,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:21,908 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 22:27:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:22,245 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-15 22:27:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:22,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:27:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:22,247 INFO L225 Difference]: With dead ends: 512 [2019-11-15 22:27:22,248 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 22:27:22,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 22:27:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-15 22:27:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 22:27:22,255 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-15 22:27:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:22,256 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 22:27:22,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 22:27:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:27:22,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:22,257 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:22,257 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-11-15 22:27:22,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:22,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131684285] [2019-11-15 22:27:22,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:22,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:22,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131684285] [2019-11-15 22:27:22,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:22,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:22,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391420778] [2019-11-15 22:27:22,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:22,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:22,325 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 22:27:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:22,720 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-15 22:27:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:22,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:27:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:22,722 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:27:22,722 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:27:22,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:27:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:27:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 22:27:22,733 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-15 22:27:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:22,733 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 22:27:22,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 22:27:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:27:22,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:22,734 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:22,735 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-11-15 22:27:22,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:22,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736589293] [2019-11-15 22:27:22,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:22,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:22,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:22,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736589293] [2019-11-15 22:27:22,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:22,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:22,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790846038] [2019-11-15 22:27:22,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:22,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:22,836 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 22:27:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:23,278 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-15 22:27:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:23,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:27:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:23,280 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:27:23,280 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:27:23,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:27:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 22:27:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 22:27:23,290 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-15 22:27:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:23,291 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 22:27:23,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 22:27:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:27:23,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:23,292 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:23,292 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-11-15 22:27:23,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:23,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347215641] [2019-11-15 22:27:23,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:23,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:23,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:23,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347215641] [2019-11-15 22:27:23,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:23,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:23,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551532669] [2019-11-15 22:27:23,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:23,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:23,346 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 22:27:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:23,704 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-15 22:27:23,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:23,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:27:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:23,706 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:27:23,706 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:27:23,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:27:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:27:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 22:27:23,714 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-15 22:27:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:23,714 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 22:27:23,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 22:27:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:27:23,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:23,715 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:23,716 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-11-15 22:27:23,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:23,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287388383] [2019-11-15 22:27:23,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:23,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:23,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:23,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287388383] [2019-11-15 22:27:23,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:23,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:23,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556421085] [2019-11-15 22:27:23,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:23,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:23,792 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 22:27:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:24,145 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-15 22:27:24,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:24,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 22:27:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:24,147 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:27:24,147 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:27:24,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:27:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 22:27:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 22:27:24,156 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-15 22:27:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 22:27:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 22:27:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:27:24,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:24,158 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:24,158 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:24,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-11-15 22:27:24,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:24,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468135548] [2019-11-15 22:27:24,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:24,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:24,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:24,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468135548] [2019-11-15 22:27:24,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:24,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:24,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550453203] [2019-11-15 22:27:24,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:24,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:24,227 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 22:27:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:24,575 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-15 22:27:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:24,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 22:27:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:24,577 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:27:24,577 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:27:24,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:27:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:27:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 22:27:24,585 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-15 22:27:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:24,586 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 22:27:24,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 22:27:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:27:24,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:24,587 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:24,587 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-11-15 22:27:24,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:24,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776845169] [2019-11-15 22:27:24,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:24,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:24,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:24,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776845169] [2019-11-15 22:27:24,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:24,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:24,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975461188] [2019-11-15 22:27:24,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:24,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:24,639 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 22:27:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:25,118 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-15 22:27:25,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:25,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 22:27:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:25,121 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:27:25,121 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:27:25,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:27:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 22:27:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 22:27:25,128 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-15 22:27:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:25,129 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 22:27:25,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 22:27:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:27:25,130 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:25,130 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:25,130 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-11-15 22:27:25,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:25,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470270184] [2019-11-15 22:27:25,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:25,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:25,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:25,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470270184] [2019-11-15 22:27:25,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:25,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:25,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126432918] [2019-11-15 22:27:25,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:25,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:25,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:25,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:25,187 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 22:27:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:25,533 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-15 22:27:25,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:25,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 22:27:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:25,535 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:27:25,535 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:27:25,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:27:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:27:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 22:27:25,542 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-15 22:27:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:25,543 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 22:27:25,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 22:27:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:27:25,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:25,544 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:25,544 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-11-15 22:27:25,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:25,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016221908] [2019-11-15 22:27:25,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:25,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:25,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:25,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016221908] [2019-11-15 22:27:25,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:25,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:25,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397683083] [2019-11-15 22:27:25,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:25,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:25,617 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 22:27:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:25,988 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-15 22:27:25,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:25,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:27:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:25,994 INFO L225 Difference]: With dead ends: 524 [2019-11-15 22:27:25,994 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:27:25,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:27:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 22:27:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 22:27:26,003 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-15 22:27:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:26,004 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 22:27:26,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 22:27:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:27:26,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:26,005 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:26,006 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-11-15 22:27:26,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:26,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320995633] [2019-11-15 22:27:26,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:26,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:26,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:26,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320995633] [2019-11-15 22:27:26,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:26,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:26,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080484200] [2019-11-15 22:27:26,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:26,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:26,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:26,078 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 22:27:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:26,402 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-15 22:27:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:26,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:27:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:26,405 INFO L225 Difference]: With dead ends: 501 [2019-11-15 22:27:26,405 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 22:27:26,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 22:27:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-15 22:27:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-15 22:27:26,412 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-15 22:27:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:26,413 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-15 22:27:26,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-15 22:27:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:27:26,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:26,414 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:26,414 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-11-15 22:27:26,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:26,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241029405] [2019-11-15 22:27:26,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:26,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:26,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:26,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241029405] [2019-11-15 22:27:26,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:26,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:26,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434268947] [2019-11-15 22:27:26,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:26,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:26,468 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-15 22:27:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:26,911 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-15 22:27:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:26,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:27:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:26,913 INFO L225 Difference]: With dead ends: 524 [2019-11-15 22:27:26,913 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:27:26,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:27:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 22:27:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:27:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-15 22:27:26,921 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-15 22:27:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:26,921 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-15 22:27:26,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-15 22:27:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:27:26,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:26,923 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:26,923 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-11-15 22:27:26,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:26,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15525840] [2019-11-15 22:27:26,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:26,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:27:26,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15525840] [2019-11-15 22:27:26,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:26,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:26,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074991225] [2019-11-15 22:27:26,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:26,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:26,979 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-15 22:27:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:27,031 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-15 22:27:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:27,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:27:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:27,034 INFO L225 Difference]: With dead ends: 722 [2019-11-15 22:27:27,034 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 22:27:27,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 22:27:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-15 22:27:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-15 22:27:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-15 22:27:27,052 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-15 22:27:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:27,053 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-15 22:27:27,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-15 22:27:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:27:27,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:27,054 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:27,055 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-11-15 22:27:27,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:27,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066468888] [2019-11-15 22:27:27,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:27:27,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066468888] [2019-11-15 22:27:27,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:27,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:27,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795280482] [2019-11-15 22:27:27,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:27,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:27,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,115 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-15 22:27:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:27,175 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-15 22:27:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:27,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:27:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:27,179 INFO L225 Difference]: With dead ends: 1190 [2019-11-15 22:27:27,179 INFO L226 Difference]: Without dead ends: 722 [2019-11-15 22:27:27,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-15 22:27:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-15 22:27:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 22:27:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-15 22:27:27,202 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-15 22:27:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:27,203 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-15 22:27:27,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-15 22:27:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:27:27,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:27,204 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:27,205 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-11-15 22:27:27,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:27,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80471509] [2019-11-15 22:27:27,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:27:27,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80471509] [2019-11-15 22:27:27,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:27,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:27,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415623742] [2019-11-15 22:27:27,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:27,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,269 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-15 22:27:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:27,349 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-15 22:27:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:27,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 22:27:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:27,355 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 22:27:27,355 INFO L226 Difference]: Without dead ends: 955 [2019-11-15 22:27:27,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-15 22:27:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-15 22:27:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 22:27:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-15 22:27:27,386 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-15 22:27:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:27,388 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-15 22:27:27,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-15 22:27:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:27:27,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:27,390 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:27,391 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2019-11-15 22:27:27,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:27,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580942949] [2019-11-15 22:27:27,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:27:27,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580942949] [2019-11-15 22:27:27,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:27,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:27,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001083386] [2019-11-15 22:27:27,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:27,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,449 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-15 22:27:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:27,512 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-15 22:27:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:27,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 22:27:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:27,518 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 22:27:27,519 INFO L226 Difference]: Without dead ends: 1186 [2019-11-15 22:27:27,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-15 22:27:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-15 22:27:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-15 22:27:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-15 22:27:27,557 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-15 22:27:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:27,557 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-15 22:27:27,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-15 22:27:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 22:27:27,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:27,560 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:27,560 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-11-15 22:27:27,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:27,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77362208] [2019-11-15 22:27:27,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:27,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77362208] [2019-11-15 22:27:27,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:27,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:27,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114806331] [2019-11-15 22:27:27,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:27,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,619 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-15 22:27:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:27,686 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-15 22:27:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:27,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 22:27:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:27,694 INFO L225 Difference]: With dead ends: 1423 [2019-11-15 22:27:27,694 INFO L226 Difference]: Without dead ends: 1421 [2019-11-15 22:27:27,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-15 22:27:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-15 22:27:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-15 22:27:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-15 22:27:27,737 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-15 22:27:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:27,738 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-15 22:27:27,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-15 22:27:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 22:27:27,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:27,741 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:27,742 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-11-15 22:27:27,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:27,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954642361] [2019-11-15 22:27:27,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:27,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:28,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954642361] [2019-11-15 22:27:28,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777691691] [2019-11-15 22:27:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:27:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:28,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 22:27:28,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:27:28,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:28,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 22:27:28,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:28,729 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 22:27:28,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:28,738 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_161|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|, |v_#memory_$Pointer$.offset_159|]} [2019-11-15 22:27:28,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:27:28,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:28,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:28,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:28,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:27:28,963 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:27:29,040 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:27:29,111 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:27:29,184 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:27:29,237 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,276 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 13 variables, input treesize:173, output treesize:65 [2019-11-15 22:27:29,305 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_162|]} [2019-11-15 22:27:29,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:27:29,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:29,348 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:27:29,365 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_163|]} [2019-11-15 22:27:29,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:27:29,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:29,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:27:29,439 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_165|, |v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_164|]} [2019-11-15 22:27:29,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:27:29,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:27:29,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,516 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:29,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:27:29,546 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,572 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-15 22:27:29,583 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_166|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-15 22:27:29,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:27:29,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:29,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:27:29,657 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_167|], 12=[|v_#memory_$Pointer$.base_166|]} [2019-11-15 22:27:29,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:27:29,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:29,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:27:29,727 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_167|], 12=[|v_#memory_$Pointer$.offset_168|]} [2019-11-15 22:27:29,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 48 [2019-11-15 22:27:29,736 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:29,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-11-15 22:27:29,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:29,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:52 [2019-11-15 22:27:29,831 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_161|], 20=[|v_#memory_$Pointer$.offset_169|]} [2019-11-15 22:27:29,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:29,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:29,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-11-15 22:27:29,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:29,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:29,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:29,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:52 [2019-11-15 22:27:29,998 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 20=[|v_#memory_$Pointer$.offset_170|]} [2019-11-15 22:27:30,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:27:30,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:30,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-11-15 22:27:30,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:30,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:30,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:61 [2019-11-15 22:27:30,115 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_168|], 2=[|v_#memory_int_179|], 12=[|v_#memory_$Pointer$.offset_171|]} [2019-11-15 22:27:30,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-15 22:27:30,121 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:30,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-15 22:27:30,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:30,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 26 [2019-11-15 22:27:30,179 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:30,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:30,195 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:25 [2019-11-15 22:27:30,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:30,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 22:27:30,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:30,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:30,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:30,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-11-15 22:27:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:27:30,680 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:27:30,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 22:27:30,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060362311] [2019-11-15 22:27:30,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:27:30,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:27:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:27:30,682 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 14 states. [2019-11-15 22:33:06,282 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-11-15 22:34:23,110 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-15 22:34:33,397 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-15 22:34:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:37,586 INFO L93 Difference]: Finished difference Result 7495 states and 11164 transitions. [2019-11-15 22:34:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:34:37,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2019-11-15 22:34:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:37,620 INFO L225 Difference]: With dead ends: 7495 [2019-11-15 22:34:37,620 INFO L226 Difference]: Without dead ends: 6095 [2019-11-15 22:34:37,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 71.0s TimeCoverageRelationStatistics Valid=167, Invalid=408, Unknown=25, NotChecked=0, Total=600 [2019-11-15 22:34:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-11-15 22:34:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3081. [2019-11-15 22:34:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-11-15 22:34:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4683 transitions. [2019-11-15 22:34:37,813 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4683 transitions. Word has length 164 [2019-11-15 22:34:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:37,814 INFO L462 AbstractCegarLoop]: Abstraction has 3081 states and 4683 transitions. [2019-11-15 22:34:37,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:34:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4683 transitions. [2019-11-15 22:34:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 22:34:37,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:37,821 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:38,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:34:38,025 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2019-11-15 22:34:38,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:38,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252750165] [2019-11-15 22:34:38,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:38,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:38,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:34:38,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252750165] [2019-11-15 22:34:38,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:38,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:38,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951663004] [2019-11-15 22:34:38,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:38,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:38,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:38,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:38,114 INFO L87 Difference]: Start difference. First operand 3081 states and 4683 transitions. Second operand 4 states. [2019-11-15 22:34:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:38,550 INFO L93 Difference]: Finished difference Result 6839 states and 10430 transitions. [2019-11-15 22:34:38,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:38,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-15 22:34:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:38,564 INFO L225 Difference]: With dead ends: 6839 [2019-11-15 22:34:38,564 INFO L226 Difference]: Without dead ends: 3777 [2019-11-15 22:34:38,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-11-15 22:34:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3417. [2019-11-15 22:34:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-15 22:34:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-11-15 22:34:38,683 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 170 [2019-11-15 22:34:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:38,683 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-11-15 22:34:38,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-11-15 22:34:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 22:34:38,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:38,690 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:38,691 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2019-11-15 22:34:38,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:38,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260280296] [2019-11-15 22:34:38,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:38,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:38,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 22:34:38,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260280296] [2019-11-15 22:34:38,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:38,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:38,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341467072] [2019-11-15 22:34:38,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:38,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:38,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:38,788 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-11-15 22:34:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:39,353 INFO L93 Difference]: Finished difference Result 7957 states and 12273 transitions. [2019-11-15 22:34:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:39,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 22:34:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:39,375 INFO L225 Difference]: With dead ends: 7957 [2019-11-15 22:34:39,375 INFO L226 Difference]: Without dead ends: 4559 [2019-11-15 22:34:39,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2019-11-15 22:34:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3885. [2019-11-15 22:34:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-15 22:34:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6123 transitions. [2019-11-15 22:34:39,502 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6123 transitions. Word has length 178 [2019-11-15 22:34:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:39,502 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6123 transitions. [2019-11-15 22:34:39,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6123 transitions. [2019-11-15 22:34:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:34:39,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:39,510 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:39,510 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2019-11-15 22:34:39,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:39,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746800687] [2019-11-15 22:34:39,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:39,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:39,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 22:34:39,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746800687] [2019-11-15 22:34:39,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:39,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:39,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187759811] [2019-11-15 22:34:39,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:39,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:39,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:39,608 INFO L87 Difference]: Start difference. First operand 3885 states and 6123 transitions. Second operand 4 states. [2019-11-15 22:34:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:40,314 INFO L93 Difference]: Finished difference Result 8375 states and 13050 transitions. [2019-11-15 22:34:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:40,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 22:34:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:40,324 INFO L225 Difference]: With dead ends: 8375 [2019-11-15 22:34:40,325 INFO L226 Difference]: Without dead ends: 4509 [2019-11-15 22:34:40,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2019-11-15 22:34:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 3765. [2019-11-15 22:34:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-15 22:34:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5895 transitions. [2019-11-15 22:34:40,437 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5895 transitions. Word has length 179 [2019-11-15 22:34:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:40,437 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5895 transitions. [2019-11-15 22:34:40,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5895 transitions. [2019-11-15 22:34:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:34:40,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:40,445 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:40,445 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2019-11-15 22:34:40,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:40,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894132345] [2019-11-15 22:34:40,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:40,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:40,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:34:40,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894132345] [2019-11-15 22:34:40,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:40,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:40,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893175737] [2019-11-15 22:34:40,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:34:40,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:34:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:40,576 INFO L87 Difference]: Start difference. First operand 3765 states and 5895 transitions. Second operand 5 states. [2019-11-15 22:34:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:41,247 INFO L93 Difference]: Finished difference Result 9025 states and 14137 transitions. [2019-11-15 22:34:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:41,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-11-15 22:34:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:41,263 INFO L225 Difference]: With dead ends: 9025 [2019-11-15 22:34:41,263 INFO L226 Difference]: Without dead ends: 5279 [2019-11-15 22:34:41,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2019-11-15 22:34:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 4239. [2019-11-15 22:34:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-11-15 22:34:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6753 transitions. [2019-11-15 22:34:41,388 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6753 transitions. Word has length 179 [2019-11-15 22:34:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:41,388 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6753 transitions. [2019-11-15 22:34:41,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:34:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6753 transitions. [2019-11-15 22:34:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:34:41,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:41,397 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:41,397 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2019-11-15 22:34:41,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:41,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149671273] [2019-11-15 22:34:41,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:41,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:41,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:34:41,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149671273] [2019-11-15 22:34:41,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:41,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:41,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648468692] [2019-11-15 22:34:41,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:41,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:41,473 INFO L87 Difference]: Start difference. First operand 4239 states and 6753 transitions. Second operand 4 states. [2019-11-15 22:34:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:42,145 INFO L93 Difference]: Finished difference Result 7555 states and 11938 transitions. [2019-11-15 22:34:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:42,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 22:34:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:42,155 INFO L225 Difference]: With dead ends: 7555 [2019-11-15 22:34:42,155 INFO L226 Difference]: Without dead ends: 5381 [2019-11-15 22:34:42,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-11-15 22:34:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4383. [2019-11-15 22:34:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-15 22:34:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6957 transitions. [2019-11-15 22:34:42,297 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6957 transitions. Word has length 179 [2019-11-15 22:34:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:42,298 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6957 transitions. [2019-11-15 22:34:42,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6957 transitions. [2019-11-15 22:34:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:34:42,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:42,314 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:42,314 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2019-11-15 22:34:42,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651381348] [2019-11-15 22:34:42,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:34:42,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651381348] [2019-11-15 22:34:42,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:42,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:42,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624054785] [2019-11-15 22:34:42,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:42,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:42,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:42,462 INFO L87 Difference]: Start difference. First operand 4383 states and 6957 transitions. Second operand 4 states. [2019-11-15 22:34:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:42,953 INFO L93 Difference]: Finished difference Result 7627 states and 12028 transitions. [2019-11-15 22:34:42,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:42,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 22:34:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:42,962 INFO L225 Difference]: With dead ends: 7627 [2019-11-15 22:34:42,963 INFO L226 Difference]: Without dead ends: 5381 [2019-11-15 22:34:42,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-11-15 22:34:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4395. [2019-11-15 22:34:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-11-15 22:34:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6969 transitions. [2019-11-15 22:34:43,096 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6969 transitions. Word has length 180 [2019-11-15 22:34:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:43,097 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6969 transitions. [2019-11-15 22:34:43,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6969 transitions. [2019-11-15 22:34:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:34:43,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:43,104 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:43,104 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2019-11-15 22:34:43,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:43,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141335471] [2019-11-15 22:34:43,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:43,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:43,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:34:43,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141335471] [2019-11-15 22:34:43,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:43,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:34:43,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473981562] [2019-11-15 22:34:43,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:34:43,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:43,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:34:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:43,241 INFO L87 Difference]: Start difference. First operand 4395 states and 6969 transitions. Second operand 5 states. [2019-11-15 22:34:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:43,937 INFO L93 Difference]: Finished difference Result 9949 states and 15739 transitions. [2019-11-15 22:34:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:43,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-11-15 22:34:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:43,946 INFO L225 Difference]: With dead ends: 9949 [2019-11-15 22:34:43,946 INFO L226 Difference]: Without dead ends: 5573 [2019-11-15 22:34:43,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2019-11-15 22:34:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 4263. [2019-11-15 22:34:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-15 22:34:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6789 transitions. [2019-11-15 22:34:44,078 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6789 transitions. Word has length 180 [2019-11-15 22:34:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:44,079 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6789 transitions. [2019-11-15 22:34:44,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:34:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6789 transitions. [2019-11-15 22:34:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 22:34:44,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:44,085 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:44,086 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2019-11-15 22:34:44,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:44,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107325644] [2019-11-15 22:34:44,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:34:44,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107325644] [2019-11-15 22:34:44,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:44,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:44,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870003807] [2019-11-15 22:34:44,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:44,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:44,168 INFO L87 Difference]: Start difference. First operand 4263 states and 6789 transitions. Second operand 4 states. [2019-11-15 22:34:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:44,846 INFO L93 Difference]: Finished difference Result 7385 states and 11677 transitions. [2019-11-15 22:34:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:44,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 22:34:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:44,855 INFO L225 Difference]: With dead ends: 7385 [2019-11-15 22:34:44,855 INFO L226 Difference]: Without dead ends: 5199 [2019-11-15 22:34:44,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2019-11-15 22:34:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4275. [2019-11-15 22:34:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-15 22:34:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6801 transitions. [2019-11-15 22:34:44,984 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6801 transitions. Word has length 181 [2019-11-15 22:34:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:44,985 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6801 transitions. [2019-11-15 22:34:44,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6801 transitions. [2019-11-15 22:34:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 22:34:44,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:44,991 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:44,992 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2019-11-15 22:34:44,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:44,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996913497] [2019-11-15 22:34:44,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:34:45,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996913497] [2019-11-15 22:34:45,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:45,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:45,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677890330] [2019-11-15 22:34:45,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:45,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:45,069 INFO L87 Difference]: Start difference. First operand 4275 states and 6801 transitions. Second operand 4 states. [2019-11-15 22:34:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:45,579 INFO L93 Difference]: Finished difference Result 7331 states and 11599 transitions. [2019-11-15 22:34:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:45,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 22:34:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:45,583 INFO L225 Difference]: With dead ends: 7331 [2019-11-15 22:34:45,583 INFO L226 Difference]: Without dead ends: 5139 [2019-11-15 22:34:45,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-11-15 22:34:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4287. [2019-11-15 22:34:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:34:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6813 transitions. [2019-11-15 22:34:45,689 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6813 transitions. Word has length 182 [2019-11-15 22:34:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:45,689 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6813 transitions. [2019-11-15 22:34:45,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6813 transitions. [2019-11-15 22:34:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 22:34:45,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:45,696 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:45,696 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,697 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2019-11-15 22:34:45,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:45,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027955168] [2019-11-15 22:34:45,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:45,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027955168] [2019-11-15 22:34:45,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:45,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:45,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831951868] [2019-11-15 22:34:45,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:45,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:45,778 INFO L87 Difference]: Start difference. First operand 4287 states and 6813 transitions. Second operand 4 states. [2019-11-15 22:34:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:46,333 INFO L93 Difference]: Finished difference Result 8903 states and 14078 transitions. [2019-11-15 22:34:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:46,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 22:34:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:46,336 INFO L225 Difference]: With dead ends: 8903 [2019-11-15 22:34:46,336 INFO L226 Difference]: Without dead ends: 4635 [2019-11-15 22:34:46,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-15 22:34:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-15 22:34:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:34:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6801 transitions. [2019-11-15 22:34:46,441 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6801 transitions. Word has length 184 [2019-11-15 22:34:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:46,442 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6801 transitions. [2019-11-15 22:34:46,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6801 transitions. [2019-11-15 22:34:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 22:34:46,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:46,448 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:46,448 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2019-11-15 22:34:46,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:46,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499662799] [2019-11-15 22:34:46,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:46,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:46,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:46,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499662799] [2019-11-15 22:34:46,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:46,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:46,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139589069] [2019-11-15 22:34:46,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:46,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:46,525 INFO L87 Difference]: Start difference. First operand 4287 states and 6801 transitions. Second operand 4 states. [2019-11-15 22:34:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:47,051 INFO L93 Difference]: Finished difference Result 6833 states and 10743 transitions. [2019-11-15 22:34:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:47,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 22:34:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:47,055 INFO L225 Difference]: With dead ends: 6833 [2019-11-15 22:34:47,055 INFO L226 Difference]: Without dead ends: 4635 [2019-11-15 22:34:47,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-15 22:34:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-15 22:34:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:34:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6789 transitions. [2019-11-15 22:34:47,141 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6789 transitions. Word has length 185 [2019-11-15 22:34:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:47,141 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6789 transitions. [2019-11-15 22:34:47,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6789 transitions. [2019-11-15 22:34:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 22:34:47,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:47,147 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:47,147 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2019-11-15 22:34:47,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:47,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112084157] [2019-11-15 22:34:47,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:47,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:47,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:47,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112084157] [2019-11-15 22:34:47,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:47,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:47,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390976633] [2019-11-15 22:34:47,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:47,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:47,224 INFO L87 Difference]: Start difference. First operand 4287 states and 6789 transitions. Second operand 4 states. [2019-11-15 22:34:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:47,653 INFO L93 Difference]: Finished difference Result 6833 states and 10725 transitions. [2019-11-15 22:34:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:47,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 22:34:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:47,656 INFO L225 Difference]: With dead ends: 6833 [2019-11-15 22:34:47,656 INFO L226 Difference]: Without dead ends: 4635 [2019-11-15 22:34:47,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-15 22:34:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-15 22:34:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:34:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6777 transitions. [2019-11-15 22:34:47,743 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6777 transitions. Word has length 186 [2019-11-15 22:34:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:47,744 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6777 transitions. [2019-11-15 22:34:47,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6777 transitions. [2019-11-15 22:34:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 22:34:47,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:47,748 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:47,748 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2019-11-15 22:34:47,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:47,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948366935] [2019-11-15 22:34:47,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:47,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:47,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:47,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948366935] [2019-11-15 22:34:47,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:47,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:47,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326602927] [2019-11-15 22:34:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:47,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:47,831 INFO L87 Difference]: Start difference. First operand 4287 states and 6777 transitions. Second operand 4 states. [2019-11-15 22:34:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:48,219 INFO L93 Difference]: Finished difference Result 6833 states and 10707 transitions. [2019-11-15 22:34:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:48,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-15 22:34:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:48,223 INFO L225 Difference]: With dead ends: 6833 [2019-11-15 22:34:48,223 INFO L226 Difference]: Without dead ends: 4635 [2019-11-15 22:34:48,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-15 22:34:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-15 22:34:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:34:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6765 transitions. [2019-11-15 22:34:48,305 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6765 transitions. Word has length 187 [2019-11-15 22:34:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:48,306 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6765 transitions. [2019-11-15 22:34:48,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6765 transitions. [2019-11-15 22:34:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 22:34:48,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:48,311 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:48,311 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2019-11-15 22:34:48,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:48,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203320616] [2019-11-15 22:34:48,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:48,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:48,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:48,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203320616] [2019-11-15 22:34:48,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:48,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:48,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76820918] [2019-11-15 22:34:48,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:48,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:48,390 INFO L87 Difference]: Start difference. First operand 4287 states and 6765 transitions. Second operand 4 states. [2019-11-15 22:34:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:48,802 INFO L93 Difference]: Finished difference Result 6773 states and 10617 transitions. [2019-11-15 22:34:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:48,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 22:34:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:48,806 INFO L225 Difference]: With dead ends: 6773 [2019-11-15 22:34:48,806 INFO L226 Difference]: Without dead ends: 4575 [2019-11-15 22:34:48,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-15 22:34:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-15 22:34:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:34:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-11-15 22:34:48,938 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 188 [2019-11-15 22:34:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:48,938 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-11-15 22:34:48,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-11-15 22:34:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 22:34:48,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:48,942 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:48,942 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2019-11-15 22:34:48,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:48,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768673679] [2019-11-15 22:34:48,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:48,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:48,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 22:34:49,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768673679] [2019-11-15 22:34:49,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:49,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:49,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820087896] [2019-11-15 22:34:49,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:49,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:49,025 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-11-15 22:34:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:49,438 INFO L93 Difference]: Finished difference Result 7097 states and 11097 transitions. [2019-11-15 22:34:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:49,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 22:34:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:49,441 INFO L225 Difference]: With dead ends: 7097 [2019-11-15 22:34:49,441 INFO L226 Difference]: Without dead ends: 4899 [2019-11-15 22:34:49,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2019-11-15 22:34:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4359. [2019-11-15 22:34:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-11-15 22:34:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6849 transitions. [2019-11-15 22:34:49,530 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6849 transitions. Word has length 192 [2019-11-15 22:34:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:49,530 INFO L462 AbstractCegarLoop]: Abstraction has 4359 states and 6849 transitions. [2019-11-15 22:34:49,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6849 transitions. [2019-11-15 22:34:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 22:34:49,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:49,533 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:49,534 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2019-11-15 22:34:49,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:49,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658835392] [2019-11-15 22:34:49,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:49,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:49,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:49,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658835392] [2019-11-15 22:34:49,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:49,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:49,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68446597] [2019-11-15 22:34:49,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:49,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:49,613 INFO L87 Difference]: Start difference. First operand 4359 states and 6849 transitions. Second operand 4 states. [2019-11-15 22:34:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:50,123 INFO L93 Difference]: Finished difference Result 8987 states and 14078 transitions. [2019-11-15 22:34:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:50,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 22:34:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:50,129 INFO L225 Difference]: With dead ends: 8987 [2019-11-15 22:34:50,129 INFO L226 Difference]: Without dead ends: 4647 [2019-11-15 22:34:50,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2019-11-15 22:34:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4359. [2019-11-15 22:34:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-11-15 22:34:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6837 transitions. [2019-11-15 22:34:50,263 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6837 transitions. Word has length 192 [2019-11-15 22:34:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:50,264 INFO L462 AbstractCegarLoop]: Abstraction has 4359 states and 6837 transitions. [2019-11-15 22:34:50,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6837 transitions. [2019-11-15 22:34:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 22:34:50,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:50,268 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:50,268 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2019-11-15 22:34:50,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:50,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45260570] [2019-11-15 22:34:50,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:50,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:50,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:50,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45260570] [2019-11-15 22:34:50,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:50,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:50,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691156265] [2019-11-15 22:34:50,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:50,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:50,351 INFO L87 Difference]: Start difference. First operand 4359 states and 6837 transitions. Second operand 4 states. [2019-11-15 22:34:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:50,699 INFO L93 Difference]: Finished difference Result 8987 states and 14054 transitions. [2019-11-15 22:34:50,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:50,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 22:34:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:50,702 INFO L225 Difference]: With dead ends: 8987 [2019-11-15 22:34:50,702 INFO L226 Difference]: Without dead ends: 4647 [2019-11-15 22:34:50,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2019-11-15 22:34:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4359. [2019-11-15 22:34:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-11-15 22:34:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6825 transitions. [2019-11-15 22:34:50,867 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6825 transitions. Word has length 192 [2019-11-15 22:34:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:50,867 INFO L462 AbstractCegarLoop]: Abstraction has 4359 states and 6825 transitions. [2019-11-15 22:34:50,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6825 transitions. [2019-11-15 22:34:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:34:50,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:50,870 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:50,870 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -383895469, now seen corresponding path program 1 times [2019-11-15 22:34:50,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:50,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128726836] [2019-11-15 22:34:50,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:50,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:50,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 22:34:50,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128726836] [2019-11-15 22:34:50,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:50,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:50,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122054675] [2019-11-15 22:34:50,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:50,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:50,945 INFO L87 Difference]: Start difference. First operand 4359 states and 6825 transitions. Second operand 4 states. [2019-11-15 22:34:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:51,607 INFO L93 Difference]: Finished difference Result 7097 states and 11043 transitions. [2019-11-15 22:34:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:51,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 22:34:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:51,612 INFO L225 Difference]: With dead ends: 7097 [2019-11-15 22:34:51,612 INFO L226 Difference]: Without dead ends: 4899 [2019-11-15 22:34:51,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2019-11-15 22:34:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4365. [2019-11-15 22:34:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-11-15 22:34:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6825 transitions. [2019-11-15 22:34:51,703 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6825 transitions. Word has length 193 [2019-11-15 22:34:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:51,703 INFO L462 AbstractCegarLoop]: Abstraction has 4365 states and 6825 transitions. [2019-11-15 22:34:51,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6825 transitions. [2019-11-15 22:34:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:34:51,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:51,706 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:51,706 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2019-11-15 22:34:51,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:51,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923710696] [2019-11-15 22:34:51,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:51,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:51,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:34:51,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923710696] [2019-11-15 22:34:51,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:51,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:34:51,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016281524] [2019-11-15 22:34:51,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:34:51,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:34:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:34:51,777 INFO L87 Difference]: Start difference. First operand 4365 states and 6825 transitions. Second operand 4 states. [2019-11-15 22:34:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:52,297 INFO L93 Difference]: Finished difference Result 7655 states and 11911 transitions. [2019-11-15 22:34:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:34:52,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 22:34:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:34:52,301 INFO L225 Difference]: With dead ends: 7655 [2019-11-15 22:34:52,301 INFO L226 Difference]: Without dead ends: 5457 [2019-11-15 22:34:52,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:34:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2019-11-15 22:34:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 4509. [2019-11-15 22:34:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4509 states. [2019-11-15 22:34:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 7029 transitions. [2019-11-15 22:34:52,426 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 7029 transitions. Word has length 193 [2019-11-15 22:34:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:34:52,426 INFO L462 AbstractCegarLoop]: Abstraction has 4509 states and 7029 transitions. [2019-11-15 22:34:52,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:34:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 7029 transitions. [2019-11-15 22:34:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:34:52,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:52,429 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:52,429 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-11-15 22:34:52,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:52,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517155109] [2019-11-15 22:34:52,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:52,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:52,693 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:52,693 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:34:52,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:34:52 BoogieIcfgContainer [2019-11-15 22:34:52,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:34:52,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:34:52,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:34:52,886 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:34:52,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:27:07" (3/4) ... [2019-11-15 22:34:52,890 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:34:52,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:34:52,891 INFO L168 Benchmark]: Toolchain (without parser) took 467436.16 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 868.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 678.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:52,891 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:34:52,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:52,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:52,896 INFO L168 Benchmark]: Boogie Preprocessor took 169.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:52,897 INFO L168 Benchmark]: RCFGBuilder took 1411.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.5 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:52,897 INFO L168 Benchmark]: TraceAbstraction took 464936.40 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 731.9 MB). Free memory was 999.5 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 601.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:52,898 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:34:52,900 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 760.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 169.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1411.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.5 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 464936.40 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 731.9 MB). Free memory was 999.5 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 601.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={-3:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 464.8s, OverallIterations: 66, TraceHistogramMax: 7, AutomataDifference: 453.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 14088 SDtfs, 5486 SDslu, 21499 SDs, 0 SdLazy, 14934 SolverSat, 915 SolverUnsat, 175 SolverUnknown, 0 SolverNotchecked, 374.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 302 SyntacticMatches, 38 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 72.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4509occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 65 MinimizatonAttempts, 16275 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 7490 NumberOfCodeBlocks, 7490 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7231 ConstructedInterpolants, 74 QuantifiedInterpolants, 3713535 SizeOfPredicates, 12 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 66 InterpolantComputations, 64 PerfectInterpolantSequences, 7449/7769 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:34:54,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:34:54,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:34:54,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:34:54,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:34:54,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:34:54,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:34:54,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:34:54,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:34:54,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:34:54,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:34:54,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:34:54,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:34:54,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:34:54,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:34:54,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:34:54,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:34:54,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:34:54,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:34:54,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:34:54,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:34:54,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:34:54,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:34:54,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:34:54,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:34:54,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:34:54,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:34:54,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:34:54,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:34:54,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:34:54,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:34:54,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:34:54,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:34:54,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:34:54,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:34:54,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:34:54,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:34:54,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:34:54,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:34:54,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:34:54,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:34:54,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:34:54,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:34:54,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:34:54,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:34:54,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:34:54,979 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:34:54,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:34:54,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:34:54,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:34:54,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:34:54,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:34:54,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:34:54,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:34:54,980 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:34:54,981 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:34:54,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:34:54,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:34:54,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:34:54,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:34:54,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:34:54,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:34:54,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:34:54,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:34:54,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:34:54,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:34:54,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:34:54,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:34:54,984 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:34:54,984 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:34:54,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:34:54,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:34:54,984 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/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 -> 2022a41801b102600c4bc475b4f1b54abdd4798f [2019-11-15 22:34:55,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:34:55,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:34:55,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:34:55,028 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:34:55,028 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:34:55,029 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-15 22:34:55,077 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/c2c3134ff/add5d69f1c88498f8cd567fb18965b36/FLAGcc46fcc24 [2019-11-15 22:34:55,696 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:34:55,697 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-15 22:34:55,723 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/c2c3134ff/add5d69f1c88498f8cd567fb18965b36/FLAGcc46fcc24 [2019-11-15 22:34:56,095 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/data/c2c3134ff/add5d69f1c88498f8cd567fb18965b36 [2019-11-15 22:34:56,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:34:56,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:34:56,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:34:56,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:34:56,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:34:56,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:56,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0caeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56, skipping insertion in model container [2019-11-15 22:34:56,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:56,113 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:34:56,184 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:34:56,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:34:56,774 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:34:56,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:34:56,951 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:34:56,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56 WrapperNode [2019-11-15 22:34:56,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:34:56,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:34:56,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:34:56,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:34:56,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:34:57,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:34:57,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:34:57,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:34:57,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... [2019-11-15 22:34:57,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:34:57,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:34:57,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:34:57,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:34:57,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:34:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:34:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:34:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:34:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:34:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:34:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:34:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:34:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:34:57,488 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:34:59,847 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:34:59,848 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:34:59,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:34:59,849 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:34:59,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:59 BoogieIcfgContainer [2019-11-15 22:34:59,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:34:59,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:34:59,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:34:59,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:34:59,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:34:56" (1/3) ... [2019-11-15 22:34:59,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495dc375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:34:59, skipping insertion in model container [2019-11-15 22:34:59,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:56" (2/3) ... [2019-11-15 22:34:59,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495dc375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:34:59, skipping insertion in model container [2019-11-15 22:34:59,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:59" (3/3) ... [2019-11-15 22:34:59,861 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2019-11-15 22:34:59,871 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:34:59,878 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:34:59,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:34:59,913 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:34:59,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:34:59,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:34:59,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:34:59,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:34:59,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:34:59,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:34:59,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:34:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 22:34:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:34:59,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:34:59,955 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:59,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:34:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-15 22:34:59,976 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:34:59,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1774536151] [2019-11-15 22:34:59,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:00,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:35:00,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:00,281 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:00,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1774536151] [2019-11-15 22:35:00,307 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:00,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:35:00,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722318683] [2019-11-15 22:35:00,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:00,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:00,327 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 22:35:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:00,540 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-15 22:35:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:35:00,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:35:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:00,563 INFO L225 Difference]: With dead ends: 564 [2019-11-15 22:35:00,566 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 22:35:00,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 22:35:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-15 22:35:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 22:35:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-15 22:35:00,676 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-15 22:35:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:00,676 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-15 22:35:00,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-15 22:35:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:35:00,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:00,681 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:00,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:00,889 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-11-15 22:35:00,890 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:00,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1070499260] [2019-11-15 22:35:00,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:01,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:35:01,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:01,119 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:01,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070499260] [2019-11-15 22:35:01,140 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:01,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:35:01,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834841621] [2019-11-15 22:35:01,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:01,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:01,143 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-15 22:35:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:02,039 INFO L93 Difference]: Finished difference Result 877 states and 1350 transitions. [2019-11-15 22:35:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:35:02,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 22:35:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:02,044 INFO L225 Difference]: With dead ends: 877 [2019-11-15 22:35:02,044 INFO L226 Difference]: Without dead ends: 626 [2019-11-15 22:35:02,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-15 22:35:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-11-15 22:35:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-11-15 22:35:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 947 transitions. [2019-11-15 22:35:02,098 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 947 transitions. Word has length 58 [2019-11-15 22:35:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:02,099 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 947 transitions. [2019-11-15 22:35:02,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 947 transitions. [2019-11-15 22:35:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 22:35:02,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:02,106 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:02,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:02,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash -222873622, now seen corresponding path program 1 times [2019-11-15 22:35:02,311 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:02,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [405382716] [2019-11-15 22:35:02,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:02,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:35:02,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:35:02,667 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:35:02,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [405382716] [2019-11-15 22:35:02,705 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:02,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:35:02,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363319695] [2019-11-15 22:35:02,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:35:02,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:02,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:35:02,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:02,709 INFO L87 Difference]: Start difference. First operand 624 states and 947 transitions. Second operand 3 states. [2019-11-15 22:35:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:03,660 INFO L93 Difference]: Finished difference Result 1236 states and 1885 transitions. [2019-11-15 22:35:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:35:03,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-15 22:35:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:03,667 INFO L225 Difference]: With dead ends: 1236 [2019-11-15 22:35:03,667 INFO L226 Difference]: Without dead ends: 744 [2019-11-15 22:35:03,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-11-15 22:35:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-11-15 22:35:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-11-15 22:35:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1127 transitions. [2019-11-15 22:35:03,703 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1127 transitions. Word has length 117 [2019-11-15 22:35:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:03,704 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1127 transitions. [2019-11-15 22:35:03,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:35:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1127 transitions. [2019-11-15 22:35:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 22:35:03,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:03,708 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:03,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:03,911 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 369635549, now seen corresponding path program 1 times [2019-11-15 22:35:03,912 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:03,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [125052756] [2019-11-15 22:35:03,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:04,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:35:04,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:35:04,239 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:35:04,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [125052756] [2019-11-15 22:35:04,274 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:04,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:35:04,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825184369] [2019-11-15 22:35:04,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:04,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:04,277 INFO L87 Difference]: Start difference. First operand 744 states and 1127 transitions. Second operand 4 states. [2019-11-15 22:35:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:04,881 INFO L93 Difference]: Finished difference Result 1603 states and 2440 transitions. [2019-11-15 22:35:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:35:04,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-15 22:35:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:04,888 INFO L225 Difference]: With dead ends: 1603 [2019-11-15 22:35:04,888 INFO L226 Difference]: Without dead ends: 991 [2019-11-15 22:35:04,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-15 22:35:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-15 22:35:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-15 22:35:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1499 transitions. [2019-11-15 22:35:04,931 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1499 transitions. Word has length 141 [2019-11-15 22:35:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:04,932 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1499 transitions. [2019-11-15 22:35:04,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1499 transitions. [2019-11-15 22:35:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 22:35:04,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:04,936 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:05,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:05,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-11-15 22:35:05,140 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:05,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1328691279] [2019-11-15 22:35:05,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fd6121c-12fc-4b49-a442-3f9a069a32d9/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:35:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:06,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:35:06,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:06,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:06,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 22:35:06,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:06,810 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 22:35:06,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:06,813 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|], 2=[|v_#memory_$Pointer$.base_172|, |v_#memory_$Pointer$.base_171|]} [2019-11-15 22:35:06,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:06,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:06,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:06,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:06,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:06,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:06,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:35:06,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,123 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 22:35:07,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:35:07,176 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:35:07,269 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,318 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-15 22:35:07,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:35:07,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:35:07,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,432 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:35:07,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:35:07,463 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_173|], 12=[|v_#memory_$Pointer$.base_178|]} [2019-11-15 22:35:07,470 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:35:07,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:35:07,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 22:35:07,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:35:07,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:35:07,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:35:07,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:35:07,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:35:07,687 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_171|], 20=[|v_#memory_$Pointer$.base_181|]} [2019-11-15 22:35:07,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:35:07,693 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:35:07,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:07,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:07,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:08,194 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-15 22:35:08,194 INFO L341 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-15 22:35:08,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 22:35:08,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:08,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:08,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:35:08,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:35:08,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:08,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:08,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:35:08,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:08,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:16,512 WARN L191 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2019-11-15 22:35:16,512 INFO L567 ElimStorePlain]: treesize reduction 1481, result has 5.4 percent of original size [2019-11-15 22:35:16,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:35:16,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-15 22:35:16,599 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 30=[|v_#memory_$Pointer$.base_182|]} [2019-11-15 22:35:16,610 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:35:16,712 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 22:35:16,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:16,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:16,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:49,804 WARN L191 SmtUtils]: Spent 33.07 s on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-11-15 22:35:49,804 INFO L341 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-15 22:35:49,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-15 22:35:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:49,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:35:49,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:35:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:49,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:49,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:50,071 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2019-11-15 22:35:50,071 INFO L567 ElimStorePlain]: treesize reduction 2282, result has 3.9 percent of original size [2019-11-15 22:35:50,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:35:50,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-15 22:35:50,125 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_191|], 30=[|v_#memory_$Pointer$.base_183|]} [2019-11-15 22:35:50,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:35:50,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:35:50,251 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:35:50,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:35:50,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:50,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:50,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:50,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:50,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:35:50,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:36:06,802 WARN L191 SmtUtils]: Spent 16.54 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 22:36:06,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:06,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-15 22:36:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:06,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:36:07,065 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 42 [2019-11-15 22:36:07,065 INFO L567 ElimStorePlain]: treesize reduction 1102, result has 7.7 percent of original size [2019-11-15 22:36:07,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:36:07,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-15 22:36:07,129 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_172|], 2=[|v_#memory_int_192|], 20=[|v_#memory_$Pointer$.base_184|]} [2019-11-15 22:36:07,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 22:36:07,146 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:36:07,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:07,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 22:36:07,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:36:07,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:07,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:36:07,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:36:07,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:36:07,395 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:36:07,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:07,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-15 22:36:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:07,439 INFO L496 ElimStorePlain]: Start of recursive call 4: 22 dim-0 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2019-11-15 22:36:08,437 WARN L191 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 149 [2019-11-15 22:36:08,437 INFO L567 ElimStorePlain]: treesize reduction 556, result has 31.5 percent of original size [2019-11-15 22:36:08,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 22 dim-0 vars, and 1 xjuncts. [2019-11-15 22:36:08,441 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:168 [2019-11-15 22:36:08,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:36:08,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 22:36:08,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:36:08,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:08,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:36:08,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-15 22:36:08,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:36:08,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:36:08,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:08,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:36:08,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-15 22:36:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:36:08,960 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:36:09,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-15 22:36:09,019 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:36:09,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:09,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:36:09,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-15 22:36:09,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:36:09,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:36:09,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:36:09,347 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:36:09,350 INFO L168 Benchmark]: Toolchain (without parser) took 73251.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 945.6 MB in the beginning and 1.3 GB in the end (delta: -365.8 MB). Peak memory consumption was 418.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:36:09,351 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:36:09,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:36:09,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:36:09,352 INFO L168 Benchmark]: Boogie Preprocessor took 124.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:36:09,353 INFO L168 Benchmark]: RCFGBuilder took 2661.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.2 MB). Peak memory consumption was 96.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:36:09,353 INFO L168 Benchmark]: TraceAbstraction took 69497.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -287.6 MB). Peak memory consumption was 336.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:36:09,355 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 851.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2661.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.2 MB). Peak memory consumption was 96.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69497.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -287.6 MB). Peak memory consumption was 336.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...