./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/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 6a273cfe729196c7d9dff43b10278ed3e2486c88 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/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 6a273cfe729196c7d9dff43b10278ed3e2486c88 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:56:45,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:56:45,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:56:45,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:56:45,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:56:45,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:56:45,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:56:45,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:56:45,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:56:45,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:56:45,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:56:45,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:56:45,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:56:45,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:56:45,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:56:45,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:56:45,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:56:45,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:56:45,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:56:45,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:56:45,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:56:45,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:56:45,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:56:45,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:56:45,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:56:45,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:56:45,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:56:45,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:56:45,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:56:45,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:56:45,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:56:45,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:56:45,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:56:45,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:56:45,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:56:45,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:56:45,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:56:45,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:56:45,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:56:45,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:56:45,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:56:45,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:56:45,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:56:45,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:56:45,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:56:45,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:56:45,520 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:56:45,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:56:45,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:56:45,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:56:45,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:56:45,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:56:45,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:56:45,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:56:45,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:56:45,522 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:56:45,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:56:45,522 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:56:45,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:56:45,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:56:45,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:56:45,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:56:45,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:56:45,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:56:45,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:56:45,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:56:45,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:56:45,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:56:45,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:56:45,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:56:45,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:56:45,525 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_a24fce05-251f-40f5-8267-d8a2f790c2d0/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 -> 6a273cfe729196c7d9dff43b10278ed3e2486c88 [2019-12-07 16:56:45,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:56:45,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:56:45,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:56:45,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:56:45,645 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:56:45,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-12-07 16:56:45,682 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/58850b212/0f0b5089407746f481624b0a4aeab64c/FLAG75cfac274 [2019-12-07 16:56:46,171 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:56:46,172 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-12-07 16:56:46,184 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/58850b212/0f0b5089407746f481624b0a4aeab64c/FLAG75cfac274 [2019-12-07 16:56:46,193 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/58850b212/0f0b5089407746f481624b0a4aeab64c [2019-12-07 16:56:46,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:56:46,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:56:46,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:56:46,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:56:46,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:56:46,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a30f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46, skipping insertion in model container [2019-12-07 16:56:46,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:56:46,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:56:46,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:56:46,520 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:56:46,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:56:46,602 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:56:46,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46 WrapperNode [2019-12-07 16:56:46,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:56:46,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:56:46,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:56:46,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:56:46,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:56:46,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:56:46,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:56:46,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:56:46,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... [2019-12-07 16:56:46,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:56:46,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:56:46,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:56:46,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:56:46,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/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-12-07 16:56:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:56:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:56:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:56:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:56:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:56:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:56:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:56:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:56:46,896 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:56:47,368 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 16:56:47,369 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 16:56:47,369 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:56:47,370 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:56:47,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:56:47 BoogieIcfgContainer [2019-12-07 16:56:47,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:56:47,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:56:47,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:56:47,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:56:47,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:56:46" (1/3) ... [2019-12-07 16:56:47,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a27398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:56:47, skipping insertion in model container [2019-12-07 16:56:47,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:56:46" (2/3) ... [2019-12-07 16:56:47,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a27398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:56:47, skipping insertion in model container [2019-12-07 16:56:47,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:56:47" (3/3) ... [2019-12-07 16:56:47,376 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-2.c [2019-12-07 16:56:47,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:56:47,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:56:47,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:56:47,414 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:56:47,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:56:47,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:56:47,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:56:47,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:56:47,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:56:47,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:56:47,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:56:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 16:56:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:56:47,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:47,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:47,436 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash 556191090, now seen corresponding path program 1 times [2019-12-07 16:56:47,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:47,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555792786] [2019-12-07 16:56:47,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:47,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555792786] [2019-12-07 16:56:47,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:47,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:47,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951575639] [2019-12-07 16:56:47,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:47,660 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 16:56:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:47,962 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-12-07 16:56:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:47,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 16:56:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:47,972 INFO L225 Difference]: With dead ends: 323 [2019-12-07 16:56:47,972 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 16:56:47,975 INFO L630 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-12-07 16:56:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 16:56:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 16:56:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-12-07 16:56:48,008 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 42 [2019-12-07 16:56:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:48,009 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-12-07 16:56:48,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-12-07 16:56:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:56:48,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:48,011 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:48,012 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1775050506, now seen corresponding path program 1 times [2019-12-07 16:56:48,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:48,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760116708] [2019-12-07 16:56:48,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:48,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760116708] [2019-12-07 16:56:48,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:48,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:48,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666087589] [2019-12-07 16:56:48,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:48,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:48,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:48,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:48,093 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-12-07 16:56:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:48,323 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-12-07 16:56:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:48,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 16:56:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:48,325 INFO L225 Difference]: With dead ends: 290 [2019-12-07 16:56:48,325 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 16:56:48,326 INFO L630 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-12-07 16:56:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 16:56:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 16:56:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-12-07 16:56:48,335 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 55 [2019-12-07 16:56:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:48,335 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-12-07 16:56:48,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-12-07 16:56:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:56:48,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:48,337 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:48,337 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:48,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1534527032, now seen corresponding path program 1 times [2019-12-07 16:56:48,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:48,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726817288] [2019-12-07 16:56:48,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:48,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726817288] [2019-12-07 16:56:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:48,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762098579] [2019-12-07 16:56:48,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:48,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:48,416 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-12-07 16:56:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:48,641 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-12-07 16:56:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:48,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:56:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:48,643 INFO L225 Difference]: With dead ends: 289 [2019-12-07 16:56:48,643 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 16:56:48,644 INFO L630 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-12-07 16:56:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 16:56:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-12-07 16:56:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-12-07 16:56:48,654 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 56 [2019-12-07 16:56:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:48,654 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-12-07 16:56:48,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-12-07 16:56:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:56:48,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:48,656 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:48,656 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash 672003245, now seen corresponding path program 1 times [2019-12-07 16:56:48,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:48,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693670987] [2019-12-07 16:56:48,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:48,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693670987] [2019-12-07 16:56:48,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:48,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:48,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401652757] [2019-12-07 16:56:48,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:48,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:48,717 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-12-07 16:56:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:48,928 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-12-07 16:56:48,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:48,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:56:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:48,929 INFO L225 Difference]: With dead ends: 287 [2019-12-07 16:56:48,929 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 16:56:48,930 INFO L630 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-12-07 16:56:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 16:56:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 16:56:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-12-07 16:56:48,939 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 56 [2019-12-07 16:56:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:48,939 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-12-07 16:56:48,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-12-07 16:56:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:56:48,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:48,941 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:48,941 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash -648850067, now seen corresponding path program 1 times [2019-12-07 16:56:48,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:48,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063055370] [2019-12-07 16:56:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:48,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063055370] [2019-12-07 16:56:48,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:48,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:48,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783118673] [2019-12-07 16:56:48,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:48,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:48,996 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-12-07 16:56:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:49,176 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-12-07 16:56:49,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:49,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:56:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:49,178 INFO L225 Difference]: With dead ends: 286 [2019-12-07 16:56:49,178 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 16:56:49,178 INFO L630 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-12-07 16:56:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 16:56:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 16:56:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-12-07 16:56:49,183 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 56 [2019-12-07 16:56:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:49,183 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-12-07 16:56:49,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-12-07 16:56:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:56:49,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:49,184 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:49,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash 487016228, now seen corresponding path program 1 times [2019-12-07 16:56:49,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:49,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910394727] [2019-12-07 16:56:49,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:49,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910394727] [2019-12-07 16:56:49,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:49,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:49,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412507481] [2019-12-07 16:56:49,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:49,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:49,221 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-12-07 16:56:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:49,405 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-12-07 16:56:49,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:49,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:56:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:49,406 INFO L225 Difference]: With dead ends: 286 [2019-12-07 16:56:49,407 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 16:56:49,407 INFO L630 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-12-07 16:56:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 16:56:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 16:56:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-12-07 16:56:49,411 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 56 [2019-12-07 16:56:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:49,411 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-12-07 16:56:49,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-12-07 16:56:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 16:56:49,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:49,412 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:49,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1277290719, now seen corresponding path program 1 times [2019-12-07 16:56:49,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:49,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660778147] [2019-12-07 16:56:49,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:49,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660778147] [2019-12-07 16:56:49,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:49,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:49,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885064422] [2019-12-07 16:56:49,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:49,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:49,447 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-12-07 16:56:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:49,631 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-12-07 16:56:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:49,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 16:56:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:49,632 INFO L225 Difference]: With dead ends: 286 [2019-12-07 16:56:49,632 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 16:56:49,633 INFO L630 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-12-07 16:56:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 16:56:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 16:56:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-12-07 16:56:49,636 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 57 [2019-12-07 16:56:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:49,636 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-12-07 16:56:49,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-12-07 16:56:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 16:56:49,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:49,637 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:49,637 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1758000417, now seen corresponding path program 1 times [2019-12-07 16:56:49,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:49,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228805491] [2019-12-07 16:56:49,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:49,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228805491] [2019-12-07 16:56:49,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:49,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:49,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766524018] [2019-12-07 16:56:49,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:49,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:49,680 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-12-07 16:56:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:49,887 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-12-07 16:56:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:49,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 16:56:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:49,888 INFO L225 Difference]: With dead ends: 286 [2019-12-07 16:56:49,888 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 16:56:49,889 INFO L630 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-12-07 16:56:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 16:56:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 16:56:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-12-07 16:56:49,893 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 58 [2019-12-07 16:56:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:49,894 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-12-07 16:56:49,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-12-07 16:56:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 16:56:49,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:49,895 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:49,895 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1101901060, now seen corresponding path program 1 times [2019-12-07 16:56:49,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:49,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083791691] [2019-12-07 16:56:49,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:49,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083791691] [2019-12-07 16:56:49,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:49,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:49,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310497693] [2019-12-07 16:56:49,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:49,939 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-12-07 16:56:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:50,111 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-12-07 16:56:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:50,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 16:56:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:50,113 INFO L225 Difference]: With dead ends: 276 [2019-12-07 16:56:50,113 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 16:56:50,113 INFO L630 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-12-07 16:56:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 16:56:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-12-07 16:56:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:56:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-12-07 16:56:50,116 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 59 [2019-12-07 16:56:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:50,116 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-12-07 16:56:50,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-12-07 16:56:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 16:56:50,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:50,117 INFO L410 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, 1] [2019-12-07 16:56:50,117 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash -428902252, now seen corresponding path program 1 times [2019-12-07 16:56:50,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:50,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153261328] [2019-12-07 16:56:50,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:50,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153261328] [2019-12-07 16:56:50,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:50,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:50,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412367803] [2019-12-07 16:56:50,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:50,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:50,155 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-12-07 16:56:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:50,353 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-12-07 16:56:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:50,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 16:56:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:50,354 INFO L225 Difference]: With dead ends: 316 [2019-12-07 16:56:50,354 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 16:56:50,355 INFO L630 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-12-07 16:56:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 16:56:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 16:56:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-12-07 16:56:50,360 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 59 [2019-12-07 16:56:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:50,360 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-12-07 16:56:50,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-12-07 16:56:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 16:56:50,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:50,361 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:50,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1633215704, now seen corresponding path program 1 times [2019-12-07 16:56:50,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:50,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92437102] [2019-12-07 16:56:50,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:50,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92437102] [2019-12-07 16:56:50,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:50,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:50,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689485745] [2019-12-07 16:56:50,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:50,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:50,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:50,401 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-12-07 16:56:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:50,633 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-12-07 16:56:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:50,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 16:56:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:50,635 INFO L225 Difference]: With dead ends: 338 [2019-12-07 16:56:50,635 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 16:56:50,635 INFO L630 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-12-07 16:56:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 16:56:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 16:56:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-12-07 16:56:50,639 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 72 [2019-12-07 16:56:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:50,639 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-12-07 16:56:50,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-12-07 16:56:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 16:56:50,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:50,640 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:50,640 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1042510374, now seen corresponding path program 1 times [2019-12-07 16:56:50,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:50,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178792894] [2019-12-07 16:56:50,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:50,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178792894] [2019-12-07 16:56:50,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:50,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:50,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917204991] [2019-12-07 16:56:50,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:50,679 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-12-07 16:56:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:50,903 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-12-07 16:56:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:50,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 16:56:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:50,904 INFO L225 Difference]: With dead ends: 337 [2019-12-07 16:56:50,904 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 16:56:50,905 INFO L630 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-12-07 16:56:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 16:56:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-12-07 16:56:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-12-07 16:56:50,908 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 73 [2019-12-07 16:56:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:50,908 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-12-07 16:56:50,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-12-07 16:56:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 16:56:50,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:50,909 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:50,909 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1905034161, now seen corresponding path program 1 times [2019-12-07 16:56:50,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:50,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687238710] [2019-12-07 16:56:50,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:50,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687238710] [2019-12-07 16:56:50,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:50,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:50,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174672810] [2019-12-07 16:56:50,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:50,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:50,941 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-12-07 16:56:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:51,187 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-12-07 16:56:51,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:51,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 16:56:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:51,189 INFO L225 Difference]: With dead ends: 335 [2019-12-07 16:56:51,189 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 16:56:51,189 INFO L630 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-12-07 16:56:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 16:56:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-12-07 16:56:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-12-07 16:56:51,194 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 73 [2019-12-07 16:56:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:51,195 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-12-07 16:56:51,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-12-07 16:56:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 16:56:51,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:51,196 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:51,196 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1069079823, now seen corresponding path program 1 times [2019-12-07 16:56:51,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:51,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552008668] [2019-12-07 16:56:51,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:51,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552008668] [2019-12-07 16:56:51,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:51,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:51,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067974318] [2019-12-07 16:56:51,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:51,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:51,239 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-12-07 16:56:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:51,503 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-12-07 16:56:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:51,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 16:56:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:51,504 INFO L225 Difference]: With dead ends: 334 [2019-12-07 16:56:51,504 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 16:56:51,505 INFO L630 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-12-07 16:56:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 16:56:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 16:56:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-12-07 16:56:51,508 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 73 [2019-12-07 16:56:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:51,508 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-12-07 16:56:51,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-12-07 16:56:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 16:56:51,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:51,509 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:51,510 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:51,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2090021178, now seen corresponding path program 1 times [2019-12-07 16:56:51,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:51,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29437675] [2019-12-07 16:56:51,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:51,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29437675] [2019-12-07 16:56:51,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:51,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:51,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622789359] [2019-12-07 16:56:51,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:51,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:51,545 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-12-07 16:56:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:51,775 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-12-07 16:56:51,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:51,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 16:56:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:51,776 INFO L225 Difference]: With dead ends: 334 [2019-12-07 16:56:51,776 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 16:56:51,777 INFO L630 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-12-07 16:56:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 16:56:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 16:56:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-12-07 16:56:51,780 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 73 [2019-12-07 16:56:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:51,780 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-12-07 16:56:51,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-12-07 16:56:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 16:56:51,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:51,781 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:51,781 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash 438928319, now seen corresponding path program 1 times [2019-12-07 16:56:51,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:51,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777908830] [2019-12-07 16:56:51,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:51,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777908830] [2019-12-07 16:56:51,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:51,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:51,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248826894] [2019-12-07 16:56:51,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:51,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:51,810 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-12-07 16:56:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:52,020 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-12-07 16:56:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:52,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 16:56:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:52,021 INFO L225 Difference]: With dead ends: 334 [2019-12-07 16:56:52,021 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 16:56:52,022 INFO L630 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-12-07 16:56:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 16:56:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 16:56:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-12-07 16:56:52,027 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 74 [2019-12-07 16:56:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:52,027 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-12-07 16:56:52,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-12-07 16:56:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 16:56:52,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:52,028 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:52,028 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:52,028 INFO L82 PathProgramCache]: Analyzing trace with hash -94817791, now seen corresponding path program 1 times [2019-12-07 16:56:52,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:52,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093806670] [2019-12-07 16:56:52,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:52,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093806670] [2019-12-07 16:56:52,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:52,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:52,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161596807] [2019-12-07 16:56:52,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:52,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:52,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:52,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:52,061 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-12-07 16:56:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:52,310 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-12-07 16:56:52,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:52,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 16:56:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:52,312 INFO L225 Difference]: With dead ends: 334 [2019-12-07 16:56:52,312 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 16:56:52,312 INFO L630 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-12-07 16:56:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 16:56:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 16:56:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-12-07 16:56:52,315 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 75 [2019-12-07 16:56:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:52,316 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-12-07 16:56:52,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-12-07 16:56:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:56:52,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:52,316 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:52,316 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1082847206, now seen corresponding path program 1 times [2019-12-07 16:56:52,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:52,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903113828] [2019-12-07 16:56:52,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:56:52,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903113828] [2019-12-07 16:56:52,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:52,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:52,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545966526] [2019-12-07 16:56:52,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:52,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:52,348 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-12-07 16:56:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:52,533 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-12-07 16:56:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:52,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 16:56:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:52,534 INFO L225 Difference]: With dead ends: 324 [2019-12-07 16:56:52,534 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 16:56:52,535 INFO L630 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-12-07 16:56:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 16:56:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-12-07 16:56:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:56:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-12-07 16:56:52,538 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 76 [2019-12-07 16:56:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:52,538 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-12-07 16:56:52,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-12-07 16:56:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 16:56:52,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:52,539 INFO L410 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-12-07 16:56:52,539 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -130948224, now seen corresponding path program 1 times [2019-12-07 16:56:52,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:52,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712089026] [2019-12-07 16:56:52,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:52,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712089026] [2019-12-07 16:56:52,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:52,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:52,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270862911] [2019-12-07 16:56:52,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:52,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:52,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:52,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:52,580 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-12-07 16:56:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:52,870 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-12-07 16:56:52,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:52,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 16:56:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:52,871 INFO L225 Difference]: With dead ends: 424 [2019-12-07 16:56:52,871 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 16:56:52,872 INFO L630 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-12-07 16:56:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 16:56:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 209. [2019-12-07 16:56:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-07 16:56:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2019-12-07 16:56:52,876 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 81 [2019-12-07 16:56:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:52,876 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2019-12-07 16:56:52,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2019-12-07 16:56:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 16:56:52,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:52,877 INFO L410 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-12-07 16:56:52,877 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1502755522, now seen corresponding path program 1 times [2019-12-07 16:56:52,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:52,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278907669] [2019-12-07 16:56:52,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:52,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278907669] [2019-12-07 16:56:52,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:52,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:52,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656560870] [2019-12-07 16:56:52,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:52,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:52,913 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand 4 states. [2019-12-07 16:56:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:53,188 INFO L93 Difference]: Finished difference Result 448 states and 697 transitions. [2019-12-07 16:56:53,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:53,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 16:56:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:53,190 INFO L225 Difference]: With dead ends: 448 [2019-12-07 16:56:53,190 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 16:56:53,190 INFO L630 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-12-07 16:56:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 16:56:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 233. [2019-12-07 16:56:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 16:56:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 364 transitions. [2019-12-07 16:56:53,194 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 364 transitions. Word has length 81 [2019-12-07 16:56:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:53,195 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 364 transitions. [2019-12-07 16:56:53,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 364 transitions. [2019-12-07 16:56:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 16:56:53,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:53,195 INFO L410 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, 1] [2019-12-07 16:56:53,195 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:53,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash 33163590, now seen corresponding path program 1 times [2019-12-07 16:56:53,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:53,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510513512] [2019-12-07 16:56:53,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:53,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510513512] [2019-12-07 16:56:53,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:53,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:53,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17510987] [2019-12-07 16:56:53,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:53,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:53,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:53,236 INFO L87 Difference]: Start difference. First operand 233 states and 364 transitions. Second operand 4 states. [2019-12-07 16:56:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:53,582 INFO L93 Difference]: Finished difference Result 506 states and 787 transitions. [2019-12-07 16:56:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:53,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 16:56:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:53,584 INFO L225 Difference]: With dead ends: 506 [2019-12-07 16:56:53,584 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 16:56:53,585 INFO L630 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-12-07 16:56:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 16:56:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 234. [2019-12-07 16:56:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 16:56:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2019-12-07 16:56:53,589 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 82 [2019-12-07 16:56:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:53,589 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2019-12-07 16:56:53,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2019-12-07 16:56:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 16:56:53,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:53,590 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:53,590 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash 102158268, now seen corresponding path program 1 times [2019-12-07 16:56:53,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:53,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4479767] [2019-12-07 16:56:53,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:53,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4479767] [2019-12-07 16:56:53,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:53,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:53,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201207259] [2019-12-07 16:56:53,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:53,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:53,632 INFO L87 Difference]: Start difference. First operand 234 states and 365 transitions. Second operand 4 states. [2019-12-07 16:56:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:53,947 INFO L93 Difference]: Finished difference Result 507 states and 787 transitions. [2019-12-07 16:56:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:53,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 16:56:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:53,949 INFO L225 Difference]: With dead ends: 507 [2019-12-07 16:56:53,949 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 16:56:53,950 INFO L630 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-12-07 16:56:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 16:56:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 234. [2019-12-07 16:56:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 16:56:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 364 transitions. [2019-12-07 16:56:53,953 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 364 transitions. Word has length 94 [2019-12-07 16:56:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:53,954 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 364 transitions. [2019-12-07 16:56:53,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 364 transitions. [2019-12-07 16:56:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 16:56:53,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:53,955 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:53,955 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash 546058942, now seen corresponding path program 1 times [2019-12-07 16:56:53,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:53,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709533229] [2019-12-07 16:56:53,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:53,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709533229] [2019-12-07 16:56:53,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:53,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:53,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759637033] [2019-12-07 16:56:53,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:53,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:53,990 INFO L87 Difference]: Start difference. First operand 234 states and 364 transitions. Second operand 4 states. [2019-12-07 16:56:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:54,241 INFO L93 Difference]: Finished difference Result 474 states and 738 transitions. [2019-12-07 16:56:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:54,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 16:56:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:54,242 INFO L225 Difference]: With dead ends: 474 [2019-12-07 16:56:54,242 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 16:56:54,243 INFO L630 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-12-07 16:56:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 16:56:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2019-12-07 16:56:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 16:56:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-12-07 16:56:54,248 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 94 [2019-12-07 16:56:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:54,248 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-12-07 16:56:54,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-12-07 16:56:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 16:56:54,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:54,249 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:54,249 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1214475206, now seen corresponding path program 1 times [2019-12-07 16:56:54,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:54,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646870586] [2019-12-07 16:56:54,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:54,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646870586] [2019-12-07 16:56:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:54,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:54,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101227781] [2019-12-07 16:56:54,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:54,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:54,291 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-12-07 16:56:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:54,662 INFO L93 Difference]: Finished difference Result 506 states and 782 transitions. [2019-12-07 16:56:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:54,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 16:56:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:54,666 INFO L225 Difference]: With dead ends: 506 [2019-12-07 16:56:54,667 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 16:56:54,668 INFO L630 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-12-07 16:56:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 16:56:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 234. [2019-12-07 16:56:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 16:56:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-12-07 16:56:54,677 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 95 [2019-12-07 16:56:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:54,678 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-12-07 16:56:54,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-12-07 16:56:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 16:56:54,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:54,680 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:54,680 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash 351951419, now seen corresponding path program 1 times [2019-12-07 16:56:54,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:54,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772427744] [2019-12-07 16:56:54,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:54,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772427744] [2019-12-07 16:56:54,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:54,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:54,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682312403] [2019-12-07 16:56:54,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:54,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:54,734 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-12-07 16:56:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:55,020 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2019-12-07 16:56:55,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:55,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 16:56:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:55,022 INFO L225 Difference]: With dead ends: 504 [2019-12-07 16:56:55,022 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 16:56:55,023 INFO L630 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-12-07 16:56:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 16:56:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2019-12-07 16:56:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 16:56:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-12-07 16:56:55,028 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 95 [2019-12-07 16:56:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:55,028 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-12-07 16:56:55,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-12-07 16:56:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 16:56:55,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:55,029 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:55,029 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -968901893, now seen corresponding path program 1 times [2019-12-07 16:56:55,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:55,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238825945] [2019-12-07 16:56:55,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:55,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238825945] [2019-12-07 16:56:55,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:55,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:55,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538935541] [2019-12-07 16:56:55,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:55,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:55,069 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-12-07 16:56:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:55,424 INFO L93 Difference]: Finished difference Result 503 states and 775 transitions. [2019-12-07 16:56:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:55,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 16:56:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:55,428 INFO L225 Difference]: With dead ends: 503 [2019-12-07 16:56:55,428 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 16:56:55,429 INFO L630 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-12-07 16:56:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 16:56:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 234. [2019-12-07 16:56:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 16:56:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-12-07 16:56:55,438 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 95 [2019-12-07 16:56:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:55,439 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-12-07 16:56:55,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-12-07 16:56:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 16:56:55,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:55,441 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:55,441 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash 166964402, now seen corresponding path program 1 times [2019-12-07 16:56:55,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:55,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000699781] [2019-12-07 16:56:55,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 16:56:55,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000699781] [2019-12-07 16:56:55,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:55,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:56:55,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904307743] [2019-12-07 16:56:55,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:56:55,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:56:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:56:55,489 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 5 states. [2019-12-07 16:56:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:55,785 INFO L93 Difference]: Finished difference Result 470 states and 728 transitions. [2019-12-07 16:56:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:56:55,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-07 16:56:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:55,787 INFO L225 Difference]: With dead ends: 470 [2019-12-07 16:56:55,787 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 16:56:55,787 INFO L630 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-12-07 16:56:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 16:56:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-12-07 16:56:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 386 transitions. [2019-12-07 16:56:55,791 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 386 transitions. Word has length 95 [2019-12-07 16:56:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:55,791 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 386 transitions. [2019-12-07 16:56:55,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:56:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 386 transitions. [2019-12-07 16:56:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 16:56:55,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:55,792 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:55,792 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1227970425, now seen corresponding path program 1 times [2019-12-07 16:56:55,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:55,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711526678] [2019-12-07 16:56:55,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:55,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711526678] [2019-12-07 16:56:55,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:55,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:55,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381490082] [2019-12-07 16:56:55,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:55,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:55,825 INFO L87 Difference]: Start difference. First operand 254 states and 386 transitions. Second operand 4 states. [2019-12-07 16:56:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:56,049 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-12-07 16:56:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:56,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 16:56:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:56,050 INFO L225 Difference]: With dead ends: 511 [2019-12-07 16:56:56,050 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 16:56:56,051 INFO L630 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-12-07 16:56:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 16:56:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 16:56:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2019-12-07 16:56:56,055 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 95 [2019-12-07 16:56:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:56,056 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2019-12-07 16:56:56,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2019-12-07 16:56:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 16:56:56,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:56,057 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:56,057 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -92882887, now seen corresponding path program 1 times [2019-12-07 16:56:56,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:56,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260454049] [2019-12-07 16:56:56,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:56,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260454049] [2019-12-07 16:56:56,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:56,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:56,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908809178] [2019-12-07 16:56:56,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:56,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:56,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:56,097 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand 4 states. [2019-12-07 16:56:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:56,325 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-12-07 16:56:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:56,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 16:56:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:56,326 INFO L225 Difference]: With dead ends: 510 [2019-12-07 16:56:56,326 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 16:56:56,327 INFO L630 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-12-07 16:56:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 16:56:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-12-07 16:56:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-12-07 16:56:56,331 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 95 [2019-12-07 16:56:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:56,331 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-12-07 16:56:56,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-12-07 16:56:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 16:56:56,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:56,332 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:56,332 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash -93744320, now seen corresponding path program 1 times [2019-12-07 16:56:56,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:56,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098153965] [2019-12-07 16:56:56,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:56,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098153965] [2019-12-07 16:56:56,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:56,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:56,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507092624] [2019-12-07 16:56:56,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:56,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:56,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:56,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:56,366 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-12-07 16:56:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:56,624 INFO L93 Difference]: Finished difference Result 543 states and 820 transitions. [2019-12-07 16:56:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:56,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 16:56:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:56,625 INFO L225 Difference]: With dead ends: 543 [2019-12-07 16:56:56,625 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 16:56:56,626 INFO L630 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-12-07 16:56:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 16:56:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2019-12-07 16:56:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-12-07 16:56:56,631 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 96 [2019-12-07 16:56:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:56,632 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-12-07 16:56:56,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-12-07 16:56:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 16:56:56,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:56,633 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:56,633 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:56,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1293041090, now seen corresponding path program 1 times [2019-12-07 16:56:56,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:56,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757514587] [2019-12-07 16:56:56,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:56,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757514587] [2019-12-07 16:56:56,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:56,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:56,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962659943] [2019-12-07 16:56:56,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:56,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:56,673 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-12-07 16:56:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:56,898 INFO L93 Difference]: Finished difference Result 510 states and 771 transitions. [2019-12-07 16:56:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:56,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 16:56:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:56,900 INFO L225 Difference]: With dead ends: 510 [2019-12-07 16:56:56,900 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 16:56:56,901 INFO L630 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-12-07 16:56:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 16:56:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-12-07 16:56:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-12-07 16:56:56,904 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 96 [2019-12-07 16:56:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:56,904 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-12-07 16:56:56,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-12-07 16:56:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 16:56:56,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:56,905 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:56,905 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash -248139585, now seen corresponding path program 1 times [2019-12-07 16:56:56,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:56,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865363103] [2019-12-07 16:56:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:56,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865363103] [2019-12-07 16:56:56,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:56,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:56,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218222081] [2019-12-07 16:56:56,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:56,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:56,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:56,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:56,939 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-12-07 16:56:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:57,196 INFO L93 Difference]: Finished difference Result 543 states and 816 transitions. [2019-12-07 16:56:57,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:57,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 16:56:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:57,198 INFO L225 Difference]: With dead ends: 543 [2019-12-07 16:56:57,198 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 16:56:57,198 INFO L630 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-12-07 16:56:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 16:56:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2019-12-07 16:56:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-12-07 16:56:57,202 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 97 [2019-12-07 16:56:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:57,202 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-12-07 16:56:57,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-12-07 16:56:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 16:56:57,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:57,203 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:57,203 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash -207464835, now seen corresponding path program 1 times [2019-12-07 16:56:57,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:57,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638185585] [2019-12-07 16:56:57,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:57,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638185585] [2019-12-07 16:56:57,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:57,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008055806] [2019-12-07 16:56:57,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:57,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:57,240 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-12-07 16:56:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:57,452 INFO L93 Difference]: Finished difference Result 510 states and 767 transitions. [2019-12-07 16:56:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:57,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 16:56:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:57,453 INFO L225 Difference]: With dead ends: 510 [2019-12-07 16:56:57,454 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 16:56:57,454 INFO L630 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-12-07 16:56:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 16:56:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-12-07 16:56:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-12-07 16:56:57,458 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 97 [2019-12-07 16:56:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:57,458 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-12-07 16:56:57,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-12-07 16:56:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:56:57,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:57,459 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:57,459 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:57,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash 525337189, now seen corresponding path program 1 times [2019-12-07 16:56:57,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:57,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49266135] [2019-12-07 16:56:57,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:57,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49266135] [2019-12-07 16:56:57,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:57,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:57,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946727641] [2019-12-07 16:56:57,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:57,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:57,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:57,491 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-12-07 16:56:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:57,760 INFO L93 Difference]: Finished difference Result 543 states and 812 transitions. [2019-12-07 16:56:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:57,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 16:56:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:57,761 INFO L225 Difference]: With dead ends: 543 [2019-12-07 16:56:57,761 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 16:56:57,761 INFO L630 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-12-07 16:56:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 16:56:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2019-12-07 16:56:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-12-07 16:56:57,766 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 98 [2019-12-07 16:56:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:57,766 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-12-07 16:56:57,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-12-07 16:56:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:56:57,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:57,767 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:57,767 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1786254439, now seen corresponding path program 1 times [2019-12-07 16:56:57,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:57,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433521910] [2019-12-07 16:56:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:57,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433521910] [2019-12-07 16:56:57,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:57,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:57,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904137908] [2019-12-07 16:56:57,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:57,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:57,805 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-12-07 16:56:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:58,024 INFO L93 Difference]: Finished difference Result 510 states and 763 transitions. [2019-12-07 16:56:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:58,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 16:56:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:58,025 INFO L225 Difference]: With dead ends: 510 [2019-12-07 16:56:58,025 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 16:56:58,026 INFO L630 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-12-07 16:56:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 16:56:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-12-07 16:56:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-12-07 16:56:58,029 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 98 [2019-12-07 16:56:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:58,029 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-12-07 16:56:58,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-12-07 16:56:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:56:58,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:58,030 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:58,030 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:58,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1923900, now seen corresponding path program 1 times [2019-12-07 16:56:58,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:58,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735247565] [2019-12-07 16:56:58,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:58,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735247565] [2019-12-07 16:56:58,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:58,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:58,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459937569] [2019-12-07 16:56:58,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:58,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:58,065 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-12-07 16:56:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:58,325 INFO L93 Difference]: Finished difference Result 533 states and 796 transitions. [2019-12-07 16:56:58,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:58,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 16:56:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:58,326 INFO L225 Difference]: With dead ends: 533 [2019-12-07 16:56:58,327 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 16:56:58,327 INFO L630 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-12-07 16:56:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 16:56:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 254. [2019-12-07 16:56:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-12-07 16:56:58,331 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 99 [2019-12-07 16:56:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:58,331 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-12-07 16:56:58,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-12-07 16:56:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:56:58,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:58,332 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:56:58,332 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:58,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:58,332 INFO L82 PathProgramCache]: Analyzing trace with hash 431805186, now seen corresponding path program 1 times [2019-12-07 16:56:58,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:58,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603185466] [2019-12-07 16:56:58,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:58,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603185466] [2019-12-07 16:56:58,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:58,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:58,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333342653] [2019-12-07 16:56:58,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:58,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:58,370 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-12-07 16:56:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:58,597 INFO L93 Difference]: Finished difference Result 500 states and 747 transitions. [2019-12-07 16:56:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:58,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 16:56:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:58,599 INFO L225 Difference]: With dead ends: 500 [2019-12-07 16:56:58,599 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 16:56:58,599 INFO L630 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-12-07 16:56:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 16:56:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 254. [2019-12-07 16:56:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-12-07 16:56:58,606 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 99 [2019-12-07 16:56:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:58,606 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-12-07 16:56:58,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-12-07 16:56:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 16:56:58,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:58,608 INFO L410 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] [2019-12-07 16:56:58,608 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1239923848, now seen corresponding path program 1 times [2019-12-07 16:56:58,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:58,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825937308] [2019-12-07 16:56:58,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:58,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825937308] [2019-12-07 16:56:58,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:58,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:58,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642513904] [2019-12-07 16:56:58,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:58,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:58,657 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-12-07 16:56:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:58,919 INFO L93 Difference]: Finished difference Result 533 states and 792 transitions. [2019-12-07 16:56:58,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:58,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 16:56:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:58,921 INFO L225 Difference]: With dead ends: 533 [2019-12-07 16:56:58,921 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 16:56:58,921 INFO L630 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-12-07 16:56:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 16:56:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 254. [2019-12-07 16:56:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:56:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-12-07 16:56:58,925 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 103 [2019-12-07 16:56:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:58,926 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-12-07 16:56:58,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-12-07 16:56:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 16:56:58,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:58,926 INFO L410 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] [2019-12-07 16:56:58,926 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:58,927 INFO L82 PathProgramCache]: Analyzing trace with hash -560651594, now seen corresponding path program 1 times [2019-12-07 16:56:58,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:58,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006427518] [2019-12-07 16:56:58,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:56:58,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006427518] [2019-12-07 16:56:58,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:58,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:58,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640949191] [2019-12-07 16:56:58,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:58,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:58,966 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-12-07 16:56:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:59,207 INFO L93 Difference]: Finished difference Result 541 states and 807 transitions. [2019-12-07 16:56:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:59,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 16:56:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:59,209 INFO L225 Difference]: With dead ends: 541 [2019-12-07 16:56:59,209 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 16:56:59,209 INFO L630 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-12-07 16:56:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 16:56:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 280. [2019-12-07 16:56:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:56:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 420 transitions. [2019-12-07 16:56:59,213 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 420 transitions. Word has length 103 [2019-12-07 16:56:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:59,213 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 420 transitions. [2019-12-07 16:56:59,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 420 transitions. [2019-12-07 16:56:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 16:56:59,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:59,214 INFO L410 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] [2019-12-07 16:56:59,215 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash 491609081, now seen corresponding path program 1 times [2019-12-07 16:56:59,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:59,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041780624] [2019-12-07 16:56:59,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:59,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041780624] [2019-12-07 16:56:59,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:59,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:59,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966874665] [2019-12-07 16:56:59,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:59,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:59,260 INFO L87 Difference]: Start difference. First operand 280 states and 420 transitions. Second operand 4 states. [2019-12-07 16:56:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:59,507 INFO L93 Difference]: Finished difference Result 585 states and 880 transitions. [2019-12-07 16:56:59,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:59,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 16:56:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:59,509 INFO L225 Difference]: With dead ends: 585 [2019-12-07 16:56:59,509 INFO L226 Difference]: Without dead ends: 324 [2019-12-07 16:56:59,509 INFO L630 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-12-07 16:56:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-12-07 16:56:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-12-07 16:56:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:56:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 419 transitions. [2019-12-07 16:56:59,514 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 419 transitions. Word has length 106 [2019-12-07 16:56:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:59,514 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 419 transitions. [2019-12-07 16:56:59,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 419 transitions. [2019-12-07 16:56:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 16:56:59,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:59,514 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:56:59,515 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 251038648, now seen corresponding path program 1 times [2019-12-07 16:56:59,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:59,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383596567] [2019-12-07 16:56:59,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:59,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383596567] [2019-12-07 16:56:59,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:59,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:59,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946337637] [2019-12-07 16:56:59,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:59,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:59,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:59,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:59,556 INFO L87 Difference]: Start difference. First operand 280 states and 419 transitions. Second operand 4 states. [2019-12-07 16:56:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:56:59,803 INFO L93 Difference]: Finished difference Result 577 states and 865 transitions. [2019-12-07 16:56:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:56:59,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 16:56:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:56:59,805 INFO L225 Difference]: With dead ends: 577 [2019-12-07 16:56:59,805 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 16:56:59,805 INFO L630 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-12-07 16:56:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 16:56:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2019-12-07 16:56:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:56:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 418 transitions. [2019-12-07 16:56:59,811 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 418 transitions. Word has length 107 [2019-12-07 16:56:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:56:59,811 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 418 transitions. [2019-12-07 16:56:59,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:56:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2019-12-07 16:56:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 16:56:59,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:56:59,812 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:56:59,812 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:56:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:56:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1624533281, now seen corresponding path program 1 times [2019-12-07 16:56:59,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:56:59,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943753044] [2019-12-07 16:56:59,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:56:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:56:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:56:59,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943753044] [2019-12-07 16:56:59,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:56:59,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:56:59,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22145520] [2019-12-07 16:56:59,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:56:59,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:56:59,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:56:59,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:56:59,852 INFO L87 Difference]: Start difference. First operand 280 states and 418 transitions. Second operand 4 states. [2019-12-07 16:57:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:00,118 INFO L93 Difference]: Finished difference Result 577 states and 863 transitions. [2019-12-07 16:57:00,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:00,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 16:57:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:00,119 INFO L225 Difference]: With dead ends: 577 [2019-12-07 16:57:00,119 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 16:57:00,120 INFO L630 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-12-07 16:57:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 16:57:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2019-12-07 16:57:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 417 transitions. [2019-12-07 16:57:00,124 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 417 transitions. Word has length 108 [2019-12-07 16:57:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:00,124 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 417 transitions. [2019-12-07 16:57:00,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 417 transitions. [2019-12-07 16:57:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 16:57:00,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:00,125 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:00,125 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1123844899, now seen corresponding path program 1 times [2019-12-07 16:57:00,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:00,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108437435] [2019-12-07 16:57:00,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:00,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108437435] [2019-12-07 16:57:00,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:00,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:00,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851352218] [2019-12-07 16:57:00,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:00,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:00,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:00,163 INFO L87 Difference]: Start difference. First operand 280 states and 417 transitions. Second operand 4 states. [2019-12-07 16:57:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:00,425 INFO L93 Difference]: Finished difference Result 577 states and 861 transitions. [2019-12-07 16:57:00,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:00,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 16:57:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:00,426 INFO L225 Difference]: With dead ends: 577 [2019-12-07 16:57:00,426 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 16:57:00,427 INFO L630 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-12-07 16:57:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 16:57:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2019-12-07 16:57:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 416 transitions. [2019-12-07 16:57:00,431 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 416 transitions. Word has length 109 [2019-12-07 16:57:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:00,431 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 416 transitions. [2019-12-07 16:57:00,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 416 transitions. [2019-12-07 16:57:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 16:57:00,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:00,432 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:57:00,432 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1352486018, now seen corresponding path program 1 times [2019-12-07 16:57:00,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:00,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492292555] [2019-12-07 16:57:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:00,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492292555] [2019-12-07 16:57:00,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:00,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:00,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835915835] [2019-12-07 16:57:00,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:00,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:00,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:00,472 INFO L87 Difference]: Start difference. First operand 280 states and 416 transitions. Second operand 4 states. [2019-12-07 16:57:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:00,724 INFO L93 Difference]: Finished difference Result 575 states and 857 transitions. [2019-12-07 16:57:00,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:00,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 16:57:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:00,726 INFO L225 Difference]: With dead ends: 575 [2019-12-07 16:57:00,726 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 16:57:00,727 INFO L630 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-12-07 16:57:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 16:57:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2019-12-07 16:57:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 415 transitions. [2019-12-07 16:57:00,731 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 415 transitions. Word has length 109 [2019-12-07 16:57:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 415 transitions. [2019-12-07 16:57:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 415 transitions. [2019-12-07 16:57:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 16:57:00,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:00,732 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:00,732 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -962204764, now seen corresponding path program 1 times [2019-12-07 16:57:00,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:00,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518752545] [2019-12-07 16:57:00,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:00,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518752545] [2019-12-07 16:57:00,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:00,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:00,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098342916] [2019-12-07 16:57:00,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:00,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:00,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:00,771 INFO L87 Difference]: Start difference. First operand 280 states and 415 transitions. Second operand 4 states. [2019-12-07 16:57:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:01,001 INFO L93 Difference]: Finished difference Result 573 states and 852 transitions. [2019-12-07 16:57:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:01,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 16:57:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:01,003 INFO L225 Difference]: With dead ends: 573 [2019-12-07 16:57:01,003 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 16:57:01,003 INFO L630 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-12-07 16:57:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 16:57:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 280. [2019-12-07 16:57:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 414 transitions. [2019-12-07 16:57:01,010 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 414 transitions. Word has length 110 [2019-12-07 16:57:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:01,010 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 414 transitions. [2019-12-07 16:57:01,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 414 transitions. [2019-12-07 16:57:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 16:57:01,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:01,011 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:57:01,011 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 203136513, now seen corresponding path program 1 times [2019-12-07 16:57:01,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:01,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378367858] [2019-12-07 16:57:01,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:01,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378367858] [2019-12-07 16:57:01,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:01,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:01,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931813493] [2019-12-07 16:57:01,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:01,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:01,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:01,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:01,051 INFO L87 Difference]: Start difference. First operand 280 states and 414 transitions. Second operand 4 states. [2019-12-07 16:57:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:01,275 INFO L93 Difference]: Finished difference Result 570 states and 846 transitions. [2019-12-07 16:57:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:01,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 16:57:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:01,277 INFO L225 Difference]: With dead ends: 570 [2019-12-07 16:57:01,277 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 16:57:01,278 INFO L630 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-12-07 16:57:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 16:57:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 280. [2019-12-07 16:57:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 413 transitions. [2019-12-07 16:57:01,282 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 413 transitions. Word has length 110 [2019-12-07 16:57:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:01,282 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 413 transitions. [2019-12-07 16:57:01,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 413 transitions. [2019-12-07 16:57:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 16:57:01,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:01,283 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:57:01,283 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:01,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1220688160, now seen corresponding path program 1 times [2019-12-07 16:57:01,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:01,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884760442] [2019-12-07 16:57:01,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:01,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884760442] [2019-12-07 16:57:01,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:01,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:01,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240780360] [2019-12-07 16:57:01,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:01,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:01,322 INFO L87 Difference]: Start difference. First operand 280 states and 413 transitions. Second operand 4 states. [2019-12-07 16:57:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:01,533 INFO L93 Difference]: Finished difference Result 570 states and 844 transitions. [2019-12-07 16:57:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:01,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 16:57:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:01,535 INFO L225 Difference]: With dead ends: 570 [2019-12-07 16:57:01,535 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 16:57:01,535 INFO L630 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-12-07 16:57:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 16:57:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 280. [2019-12-07 16:57:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 412 transitions. [2019-12-07 16:57:01,540 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 412 transitions. Word has length 112 [2019-12-07 16:57:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:01,540 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 412 transitions. [2019-12-07 16:57:01,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 412 transitions. [2019-12-07 16:57:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 16:57:01,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:01,540 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:57:01,541 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1722495098, now seen corresponding path program 1 times [2019-12-07 16:57:01,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:01,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644550848] [2019-12-07 16:57:01,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:01,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644550848] [2019-12-07 16:57:01,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:01,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:01,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408103266] [2019-12-07 16:57:01,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:01,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:01,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:01,583 INFO L87 Difference]: Start difference. First operand 280 states and 412 transitions. Second operand 4 states. [2019-12-07 16:57:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:01,862 INFO L93 Difference]: Finished difference Result 566 states and 837 transitions. [2019-12-07 16:57:01,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:01,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 16:57:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:01,865 INFO L225 Difference]: With dead ends: 566 [2019-12-07 16:57:01,865 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 16:57:01,865 INFO L630 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-12-07 16:57:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 16:57:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 280. [2019-12-07 16:57:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 411 transitions. [2019-12-07 16:57:01,873 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 411 transitions. Word has length 113 [2019-12-07 16:57:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:01,873 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 411 transitions. [2019-12-07 16:57:01,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2019-12-07 16:57:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 16:57:01,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:01,874 INFO L410 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, 1, 1, 1, 1, 1, 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-12-07 16:57:01,874 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 630934472, now seen corresponding path program 1 times [2019-12-07 16:57:01,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:01,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371746180] [2019-12-07 16:57:01,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:01,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371746180] [2019-12-07 16:57:01,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:01,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:01,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221014956] [2019-12-07 16:57:01,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:01,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:01,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:01,918 INFO L87 Difference]: Start difference. First operand 280 states and 411 transitions. Second operand 4 states. [2019-12-07 16:57:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:02,163 INFO L93 Difference]: Finished difference Result 566 states and 835 transitions. [2019-12-07 16:57:02,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:02,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 16:57:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:02,164 INFO L225 Difference]: With dead ends: 566 [2019-12-07 16:57:02,165 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 16:57:02,165 INFO L630 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-12-07 16:57:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 16:57:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 280. [2019-12-07 16:57:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 410 transitions. [2019-12-07 16:57:02,170 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 410 transitions. Word has length 113 [2019-12-07 16:57:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:02,171 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 410 transitions. [2019-12-07 16:57:02,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2019-12-07 16:57:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 16:57:02,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:02,171 INFO L410 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, 1, 1, 1, 1, 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-12-07 16:57:02,172 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1460920242, now seen corresponding path program 1 times [2019-12-07 16:57:02,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:02,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913734885] [2019-12-07 16:57:02,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:02,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913734885] [2019-12-07 16:57:02,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:02,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:02,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32876219] [2019-12-07 16:57:02,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:02,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:02,223 INFO L87 Difference]: Start difference. First operand 280 states and 410 transitions. Second operand 4 states. [2019-12-07 16:57:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:02,545 INFO L93 Difference]: Finished difference Result 564 states and 831 transitions. [2019-12-07 16:57:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:02,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 16:57:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:02,549 INFO L225 Difference]: With dead ends: 564 [2019-12-07 16:57:02,549 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 16:57:02,550 INFO L630 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-12-07 16:57:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 16:57:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2019-12-07 16:57:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2019-12-07 16:57:02,561 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 409 transitions. Word has length 114 [2019-12-07 16:57:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:02,561 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 409 transitions. [2019-12-07 16:57:02,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2019-12-07 16:57:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 16:57:02,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:02,563 INFO L410 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, 1, 1, 1, 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-12-07 16:57:02,563 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash 800001133, now seen corresponding path program 1 times [2019-12-07 16:57:02,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:02,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935743196] [2019-12-07 16:57:02,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:02,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935743196] [2019-12-07 16:57:02,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:02,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:02,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833502386] [2019-12-07 16:57:02,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:02,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:02,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:02,610 INFO L87 Difference]: Start difference. First operand 280 states and 409 transitions. Second operand 4 states. [2019-12-07 16:57:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:02,846 INFO L93 Difference]: Finished difference Result 564 states and 829 transitions. [2019-12-07 16:57:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:02,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 16:57:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:02,848 INFO L225 Difference]: With dead ends: 564 [2019-12-07 16:57:02,848 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 16:57:02,849 INFO L630 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-12-07 16:57:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 16:57:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2019-12-07 16:57:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 408 transitions. [2019-12-07 16:57:02,854 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 408 transitions. Word has length 115 [2019-12-07 16:57:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:02,854 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 408 transitions. [2019-12-07 16:57:02,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2019-12-07 16:57:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 16:57:02,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:02,855 INFO L410 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, 1, 1, 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-12-07 16:57:02,855 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 104314899, now seen corresponding path program 1 times [2019-12-07 16:57:02,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:02,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084762251] [2019-12-07 16:57:02,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:02,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084762251] [2019-12-07 16:57:02,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:02,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:02,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000036137] [2019-12-07 16:57:02,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:02,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:02,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:02,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:02,898 INFO L87 Difference]: Start difference. First operand 280 states and 408 transitions. Second operand 4 states. [2019-12-07 16:57:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:03,120 INFO L93 Difference]: Finished difference Result 562 states and 825 transitions. [2019-12-07 16:57:03,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:03,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 16:57:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:03,121 INFO L225 Difference]: With dead ends: 562 [2019-12-07 16:57:03,122 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 16:57:03,122 INFO L630 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-12-07 16:57:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 16:57:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 280. [2019-12-07 16:57:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-07 16:57:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 407 transitions. [2019-12-07 16:57:03,126 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 407 transitions. Word has length 116 [2019-12-07 16:57:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:03,127 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 407 transitions. [2019-12-07 16:57:03,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2019-12-07 16:57:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 16:57:03,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:03,127 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-12-07 16:57:03,128 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:03,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash 301627462, now seen corresponding path program 1 times [2019-12-07 16:57:03,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:03,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855196973] [2019-12-07 16:57:03,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 16:57:03,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855196973] [2019-12-07 16:57:03,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:03,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:03,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578340519] [2019-12-07 16:57:03,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:03,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:03,168 INFO L87 Difference]: Start difference. First operand 280 states and 407 transitions. Second operand 4 states. [2019-12-07 16:57:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:03,429 INFO L93 Difference]: Finished difference Result 612 states and 902 transitions. [2019-12-07 16:57:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:03,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 16:57:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:03,431 INFO L225 Difference]: With dead ends: 612 [2019-12-07 16:57:03,431 INFO L226 Difference]: Without dead ends: 351 [2019-12-07 16:57:03,432 INFO L630 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-12-07 16:57:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-12-07 16:57:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 312. [2019-12-07 16:57:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-12-07 16:57:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 464 transitions. [2019-12-07 16:57:03,437 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 464 transitions. Word has length 116 [2019-12-07 16:57:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:03,437 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 464 transitions. [2019-12-07 16:57:03,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 464 transitions. [2019-12-07 16:57:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 16:57:03,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:03,437 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-12-07 16:57:03,438 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:03,438 INFO L82 PathProgramCache]: Analyzing trace with hash 919675825, now seen corresponding path program 1 times [2019-12-07 16:57:03,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:03,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513383647] [2019-12-07 16:57:03,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:03,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513383647] [2019-12-07 16:57:03,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:03,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:03,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184153754] [2019-12-07 16:57:03,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:03,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:03,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:03,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:03,476 INFO L87 Difference]: Start difference. First operand 312 states and 464 transitions. Second operand 4 states. [2019-12-07 16:57:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:03,783 INFO L93 Difference]: Finished difference Result 709 states and 1066 transitions. [2019-12-07 16:57:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:03,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 16:57:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:03,786 INFO L225 Difference]: With dead ends: 709 [2019-12-07 16:57:03,786 INFO L226 Difference]: Without dead ends: 416 [2019-12-07 16:57:03,787 INFO L630 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-12-07 16:57:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-07 16:57:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 351. [2019-12-07 16:57:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 16:57:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 535 transitions. [2019-12-07 16:57:03,794 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 535 transitions. Word has length 117 [2019-12-07 16:57:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:03,794 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 535 transitions. [2019-12-07 16:57:03,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 535 transitions. [2019-12-07 16:57:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 16:57:03,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:03,795 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-12-07 16:57:03,795 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1757229259, now seen corresponding path program 1 times [2019-12-07 16:57:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267976516] [2019-12-07 16:57:03,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:03,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267976516] [2019-12-07 16:57:03,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:03,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:03,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384617990] [2019-12-07 16:57:03,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:03,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:03,837 INFO L87 Difference]: Start difference. First operand 351 states and 535 transitions. Second operand 4 states. [2019-12-07 16:57:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:04,138 INFO L93 Difference]: Finished difference Result 741 states and 1127 transitions. [2019-12-07 16:57:04,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:04,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 16:57:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:04,140 INFO L225 Difference]: With dead ends: 741 [2019-12-07 16:57:04,140 INFO L226 Difference]: Without dead ends: 409 [2019-12-07 16:57:04,140 INFO L630 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-12-07 16:57:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-12-07 16:57:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 350. [2019-12-07 16:57:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 16:57:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 534 transitions. [2019-12-07 16:57:04,146 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 534 transitions. Word has length 118 [2019-12-07 16:57:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:04,146 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 534 transitions. [2019-12-07 16:57:04,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 534 transitions. [2019-12-07 16:57:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 16:57:04,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:04,147 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-12-07 16:57:04,147 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1677377206, now seen corresponding path program 1 times [2019-12-07 16:57:04,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:04,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967833994] [2019-12-07 16:57:04,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:04,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967833994] [2019-12-07 16:57:04,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:04,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:04,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883692909] [2019-12-07 16:57:04,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:04,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:04,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:04,188 INFO L87 Difference]: Start difference. First operand 350 states and 534 transitions. Second operand 4 states. [2019-12-07 16:57:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:04,408 INFO L93 Difference]: Finished difference Result 707 states and 1079 transitions. [2019-12-07 16:57:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:04,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 16:57:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:04,410 INFO L225 Difference]: With dead ends: 707 [2019-12-07 16:57:04,410 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 16:57:04,410 INFO L630 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-12-07 16:57:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 16:57:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-12-07 16:57:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 16:57:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 533 transitions. [2019-12-07 16:57:04,416 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 533 transitions. Word has length 118 [2019-12-07 16:57:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:04,416 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 533 transitions. [2019-12-07 16:57:04,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 533 transitions. [2019-12-07 16:57:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 16:57:04,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:04,417 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-12-07 16:57:04,417 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2096118795, now seen corresponding path program 1 times [2019-12-07 16:57:04,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:04,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620625563] [2019-12-07 16:57:04,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:04,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620625563] [2019-12-07 16:57:04,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:04,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:04,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589299823] [2019-12-07 16:57:04,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:04,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:04,457 INFO L87 Difference]: Start difference. First operand 350 states and 533 transitions. Second operand 4 states. [2019-12-07 16:57:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:04,683 INFO L93 Difference]: Finished difference Result 707 states and 1077 transitions. [2019-12-07 16:57:04,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:04,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 16:57:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:04,685 INFO L225 Difference]: With dead ends: 707 [2019-12-07 16:57:04,685 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 16:57:04,685 INFO L630 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-12-07 16:57:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 16:57:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-12-07 16:57:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 16:57:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2019-12-07 16:57:04,691 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 119 [2019-12-07 16:57:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:04,691 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 532 transitions. [2019-12-07 16:57:04,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 532 transitions. [2019-12-07 16:57:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 16:57:04,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:04,692 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-12-07 16:57:04,692 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash -927443473, now seen corresponding path program 1 times [2019-12-07 16:57:04,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:04,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438906853] [2019-12-07 16:57:04,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:04,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438906853] [2019-12-07 16:57:04,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:04,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:04,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546769184] [2019-12-07 16:57:04,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:04,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:04,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:04,728 INFO L87 Difference]: Start difference. First operand 350 states and 532 transitions. Second operand 4 states. [2019-12-07 16:57:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:04,951 INFO L93 Difference]: Finished difference Result 707 states and 1075 transitions. [2019-12-07 16:57:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:04,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 16:57:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:04,954 INFO L225 Difference]: With dead ends: 707 [2019-12-07 16:57:04,954 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 16:57:04,955 INFO L630 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-12-07 16:57:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 16:57:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-12-07 16:57:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 16:57:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2019-12-07 16:57:04,964 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 120 [2019-12-07 16:57:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:04,964 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2019-12-07 16:57:04,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2019-12-07 16:57:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 16:57:04,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:04,965 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-12-07 16:57:04,965 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2088451462, now seen corresponding path program 1 times [2019-12-07 16:57:04,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:04,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223955384] [2019-12-07 16:57:04,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:05,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223955384] [2019-12-07 16:57:05,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:05,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:05,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154131741] [2019-12-07 16:57:05,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:05,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:05,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:05,008 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand 4 states. [2019-12-07 16:57:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:05,249 INFO L93 Difference]: Finished difference Result 697 states and 1061 transitions. [2019-12-07 16:57:05,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:05,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 16:57:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:05,252 INFO L225 Difference]: With dead ends: 697 [2019-12-07 16:57:05,252 INFO L226 Difference]: Without dead ends: 366 [2019-12-07 16:57:05,253 INFO L630 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-12-07 16:57:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-12-07 16:57:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2019-12-07 16:57:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 16:57:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 530 transitions. [2019-12-07 16:57:05,263 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 530 transitions. Word has length 121 [2019-12-07 16:57:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:05,263 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 530 transitions. [2019-12-07 16:57:05,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 530 transitions. [2019-12-07 16:57:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 16:57:05,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:05,264 INFO L410 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, 1] [2019-12-07 16:57:05,265 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1338476630, now seen corresponding path program 1 times [2019-12-07 16:57:05,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:05,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982213086] [2019-12-07 16:57:05,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:05,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982213086] [2019-12-07 16:57:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044100648] [2019-12-07 16:57:05,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:05,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:05,314 INFO L87 Difference]: Start difference. First operand 350 states and 530 transitions. Second operand 4 states. [2019-12-07 16:57:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:05,650 INFO L93 Difference]: Finished difference Result 785 states and 1198 transitions. [2019-12-07 16:57:05,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:05,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 16:57:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:05,652 INFO L225 Difference]: With dead ends: 785 [2019-12-07 16:57:05,652 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 16:57:05,653 INFO L630 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-12-07 16:57:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 16:57:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 389. [2019-12-07 16:57:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-12-07 16:57:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 601 transitions. [2019-12-07 16:57:05,659 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 601 transitions. Word has length 122 [2019-12-07 16:57:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:05,659 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 601 transitions. [2019-12-07 16:57:05,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 601 transitions. [2019-12-07 16:57:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 16:57:05,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:05,660 INFO L410 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, 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-12-07 16:57:05,660 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1254488668, now seen corresponding path program 1 times [2019-12-07 16:57:05,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:05,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719663374] [2019-12-07 16:57:05,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:05,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719663374] [2019-12-07 16:57:05,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:05,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:05,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218959792] [2019-12-07 16:57:05,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:05,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:05,702 INFO L87 Difference]: Start difference. First operand 389 states and 601 transitions. Second operand 4 states. [2019-12-07 16:57:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:06,009 INFO L93 Difference]: Finished difference Result 817 states and 1259 transitions. [2019-12-07 16:57:06,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:06,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 16:57:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:06,011 INFO L225 Difference]: With dead ends: 817 [2019-12-07 16:57:06,011 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 16:57:06,011 INFO L630 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-12-07 16:57:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 16:57:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 350. [2019-12-07 16:57:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 16:57:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 530 transitions. [2019-12-07 16:57:06,018 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 530 transitions. Word has length 123 [2019-12-07 16:57:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:06,018 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 530 transitions. [2019-12-07 16:57:06,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 530 transitions. [2019-12-07 16:57:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 16:57:06,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:06,019 INFO L410 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, 1, 1, 1] [2019-12-07 16:57:06,019 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash -824596940, now seen corresponding path program 1 times [2019-12-07 16:57:06,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:06,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784946268] [2019-12-07 16:57:06,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:57:06,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784946268] [2019-12-07 16:57:06,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:06,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:06,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480931387] [2019-12-07 16:57:06,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:06,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:06,085 INFO L87 Difference]: Start difference. First operand 350 states and 530 transitions. Second operand 4 states. [2019-12-07 16:57:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:06,300 INFO L93 Difference]: Finished difference Result 696 states and 1058 transitions. [2019-12-07 16:57:06,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:06,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-12-07 16:57:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:06,301 INFO L225 Difference]: With dead ends: 696 [2019-12-07 16:57:06,301 INFO L226 Difference]: Without dead ends: 365 [2019-12-07 16:57:06,302 INFO L630 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-12-07 16:57:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-07 16:57:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 353. [2019-12-07 16:57:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 16:57:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2019-12-07 16:57:06,308 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 124 [2019-12-07 16:57:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:06,308 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2019-12-07 16:57:06,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2019-12-07 16:57:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 16:57:06,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:06,309 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:06,309 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash -491251270, now seen corresponding path program 1 times [2019-12-07 16:57:06,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:06,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401069245] [2019-12-07 16:57:06,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:57:06,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401069245] [2019-12-07 16:57:06,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:06,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:06,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089597006] [2019-12-07 16:57:06,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:06,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:06,346 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand 4 states. [2019-12-07 16:57:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:06,539 INFO L93 Difference]: Finished difference Result 703 states and 1065 transitions. [2019-12-07 16:57:06,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:06,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 16:57:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:06,541 INFO L225 Difference]: With dead ends: 703 [2019-12-07 16:57:06,541 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 16:57:06,541 INFO L630 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-12-07 16:57:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 16:57:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2019-12-07 16:57:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 16:57:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 532 transitions. [2019-12-07 16:57:06,548 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 532 transitions. Word has length 131 [2019-12-07 16:57:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 532 transitions. [2019-12-07 16:57:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 532 transitions. [2019-12-07 16:57:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 16:57:06,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:06,549 INFO L410 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, 1, 1, 1, 1] [2019-12-07 16:57:06,549 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:06,549 INFO L82 PathProgramCache]: Analyzing trace with hash -420121255, now seen corresponding path program 1 times [2019-12-07 16:57:06,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:06,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878531474] [2019-12-07 16:57:06,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 16:57:06,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878531474] [2019-12-07 16:57:06,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:06,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:06,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504427812] [2019-12-07 16:57:06,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:06,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:06,589 INFO L87 Difference]: Start difference. First operand 353 states and 532 transitions. Second operand 4 states. [2019-12-07 16:57:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:06,841 INFO L93 Difference]: Finished difference Result 749 states and 1138 transitions. [2019-12-07 16:57:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:06,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 16:57:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:06,843 INFO L225 Difference]: With dead ends: 749 [2019-12-07 16:57:06,843 INFO L226 Difference]: Without dead ends: 415 [2019-12-07 16:57:06,843 INFO L630 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-12-07 16:57:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-12-07 16:57:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 381. [2019-12-07 16:57:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-07 16:57:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 581 transitions. [2019-12-07 16:57:06,850 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 581 transitions. Word has length 131 [2019-12-07 16:57:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:06,850 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 581 transitions. [2019-12-07 16:57:06,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 581 transitions. [2019-12-07 16:57:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 16:57:06,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:06,851 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:06,851 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1852259409, now seen corresponding path program 1 times [2019-12-07 16:57:06,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:06,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421523311] [2019-12-07 16:57:06,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:57:06,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421523311] [2019-12-07 16:57:06,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:06,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:06,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361540968] [2019-12-07 16:57:06,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:06,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:06,896 INFO L87 Difference]: Start difference. First operand 381 states and 581 transitions. Second operand 4 states. [2019-12-07 16:57:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:07,108 INFO L93 Difference]: Finished difference Result 757 states and 1159 transitions. [2019-12-07 16:57:07,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:07,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 16:57:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:07,111 INFO L225 Difference]: With dead ends: 757 [2019-12-07 16:57:07,111 INFO L226 Difference]: Without dead ends: 395 [2019-12-07 16:57:07,111 INFO L630 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-12-07 16:57:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-07 16:57:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 381. [2019-12-07 16:57:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-07 16:57:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 580 transitions. [2019-12-07 16:57:07,122 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 580 transitions. Word has length 132 [2019-12-07 16:57:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:07,122 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 580 transitions. [2019-12-07 16:57:07,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 580 transitions. [2019-12-07 16:57:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 16:57:07,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:07,124 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:07,124 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1850591983, now seen corresponding path program 1 times [2019-12-07 16:57:07,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:07,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081012280] [2019-12-07 16:57:07,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:07,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081012280] [2019-12-07 16:57:07,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:07,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:07,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611133192] [2019-12-07 16:57:07,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:07,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:07,165 INFO L87 Difference]: Start difference. First operand 381 states and 580 transitions. Second operand 4 states. [2019-12-07 16:57:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:07,450 INFO L93 Difference]: Finished difference Result 840 states and 1287 transitions. [2019-12-07 16:57:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:07,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 16:57:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:07,452 INFO L225 Difference]: With dead ends: 840 [2019-12-07 16:57:07,452 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 16:57:07,452 INFO L630 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-12-07 16:57:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 16:57:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 393. [2019-12-07 16:57:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 16:57:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 597 transitions. [2019-12-07 16:57:07,460 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 597 transitions. Word has length 132 [2019-12-07 16:57:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:07,460 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 597 transitions. [2019-12-07 16:57:07,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 597 transitions. [2019-12-07 16:57:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 16:57:07,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:07,461 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:07,461 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -103256336, now seen corresponding path program 1 times [2019-12-07 16:57:07,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:07,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395681627] [2019-12-07 16:57:07,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:07,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395681627] [2019-12-07 16:57:07,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:07,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:07,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430090191] [2019-12-07 16:57:07,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:07,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:07,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:07,503 INFO L87 Difference]: Start difference. First operand 393 states and 597 transitions. Second operand 4 states. [2019-12-07 16:57:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:07,770 INFO L93 Difference]: Finished difference Result 852 states and 1303 transitions. [2019-12-07 16:57:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:07,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 16:57:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:07,772 INFO L225 Difference]: With dead ends: 852 [2019-12-07 16:57:07,772 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 16:57:07,773 INFO L630 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-12-07 16:57:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 16:57:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 394. [2019-12-07 16:57:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-07 16:57:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 598 transitions. [2019-12-07 16:57:07,780 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 598 transitions. Word has length 133 [2019-12-07 16:57:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:07,781 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 598 transitions. [2019-12-07 16:57:07,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 598 transitions. [2019-12-07 16:57:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 16:57:07,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:07,781 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:07,781 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash 721750612, now seen corresponding path program 1 times [2019-12-07 16:57:07,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:07,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943289149] [2019-12-07 16:57:07,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:07,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943289149] [2019-12-07 16:57:07,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:07,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:07,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989503043] [2019-12-07 16:57:07,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:07,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:07,817 INFO L87 Difference]: Start difference. First operand 394 states and 598 transitions. Second operand 4 states. [2019-12-07 16:57:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:08,102 INFO L93 Difference]: Finished difference Result 853 states and 1303 transitions. [2019-12-07 16:57:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:08,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 16:57:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:08,104 INFO L225 Difference]: With dead ends: 853 [2019-12-07 16:57:08,104 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 16:57:08,105 INFO L630 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-12-07 16:57:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 16:57:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 395. [2019-12-07 16:57:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-12-07 16:57:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 599 transitions. [2019-12-07 16:57:08,113 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 599 transitions. Word has length 134 [2019-12-07 16:57:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:08,113 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 599 transitions. [2019-12-07 16:57:08,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 599 transitions. [2019-12-07 16:57:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 16:57:08,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:08,114 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:08,114 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1791924917, now seen corresponding path program 1 times [2019-12-07 16:57:08,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:08,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052057697] [2019-12-07 16:57:08,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:08,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052057697] [2019-12-07 16:57:08,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:08,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948701403] [2019-12-07 16:57:08,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:08,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:08,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:08,152 INFO L87 Difference]: Start difference. First operand 395 states and 599 transitions. Second operand 4 states. [2019-12-07 16:57:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:08,440 INFO L93 Difference]: Finished difference Result 844 states and 1291 transitions. [2019-12-07 16:57:08,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:08,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 16:57:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:08,442 INFO L225 Difference]: With dead ends: 844 [2019-12-07 16:57:08,442 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 16:57:08,443 INFO L630 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-12-07 16:57:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 16:57:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 396. [2019-12-07 16:57:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 16:57:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 600 transitions. [2019-12-07 16:57:08,455 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 600 transitions. Word has length 135 [2019-12-07 16:57:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:08,455 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 600 transitions. [2019-12-07 16:57:08,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 600 transitions. [2019-12-07 16:57:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 16:57:08,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:08,456 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:08,456 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -875108906, now seen corresponding path program 1 times [2019-12-07 16:57:08,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:08,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215437877] [2019-12-07 16:57:08,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:08,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215437877] [2019-12-07 16:57:08,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:08,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:08,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895140254] [2019-12-07 16:57:08,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:08,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:08,495 INFO L87 Difference]: Start difference. First operand 396 states and 600 transitions. Second operand 4 states. [2019-12-07 16:57:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:08,833 INFO L93 Difference]: Finished difference Result 855 states and 1303 transitions. [2019-12-07 16:57:08,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:08,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 16:57:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:08,835 INFO L225 Difference]: With dead ends: 855 [2019-12-07 16:57:08,836 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 16:57:08,836 INFO L630 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-12-07 16:57:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 16:57:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2019-12-07 16:57:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 16:57:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 599 transitions. [2019-12-07 16:57:08,847 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 599 transitions. Word has length 137 [2019-12-07 16:57:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:08,847 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 599 transitions. [2019-12-07 16:57:08,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 599 transitions. [2019-12-07 16:57:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 16:57:08,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:08,848 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:08,848 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1299362025, now seen corresponding path program 1 times [2019-12-07 16:57:08,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:08,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838198584] [2019-12-07 16:57:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:08,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838198584] [2019-12-07 16:57:08,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:08,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:08,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179851102] [2019-12-07 16:57:08,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:08,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:08,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:08,888 INFO L87 Difference]: Start difference. First operand 396 states and 599 transitions. Second operand 4 states. [2019-12-07 16:57:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:09,192 INFO L93 Difference]: Finished difference Result 855 states and 1301 transitions. [2019-12-07 16:57:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:09,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-12-07 16:57:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:09,194 INFO L225 Difference]: With dead ends: 855 [2019-12-07 16:57:09,194 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 16:57:09,195 INFO L630 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-12-07 16:57:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 16:57:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2019-12-07 16:57:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 16:57:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 598 transitions. [2019-12-07 16:57:09,203 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 598 transitions. Word has length 138 [2019-12-07 16:57:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:09,203 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 598 transitions. [2019-12-07 16:57:09,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 598 transitions. [2019-12-07 16:57:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 16:57:09,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:09,204 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:09,204 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1253246843, now seen corresponding path program 1 times [2019-12-07 16:57:09,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:09,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250821002] [2019-12-07 16:57:09,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:09,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250821002] [2019-12-07 16:57:09,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:09,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:09,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346307002] [2019-12-07 16:57:09,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:09,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:09,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:09,240 INFO L87 Difference]: Start difference. First operand 396 states and 598 transitions. Second operand 4 states. [2019-12-07 16:57:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:09,550 INFO L93 Difference]: Finished difference Result 855 states and 1299 transitions. [2019-12-07 16:57:09,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:09,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-12-07 16:57:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:09,552 INFO L225 Difference]: With dead ends: 855 [2019-12-07 16:57:09,552 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 16:57:09,553 INFO L630 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-12-07 16:57:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 16:57:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2019-12-07 16:57:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 16:57:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2019-12-07 16:57:09,562 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 139 [2019-12-07 16:57:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:09,562 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2019-12-07 16:57:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2019-12-07 16:57:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 16:57:09,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:09,563 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:09,563 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1088438894, now seen corresponding path program 1 times [2019-12-07 16:57:09,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:09,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557009351] [2019-12-07 16:57:09,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:09,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557009351] [2019-12-07 16:57:09,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:09,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:09,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982833991] [2019-12-07 16:57:09,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:09,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:09,601 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand 4 states. [2019-12-07 16:57:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:09,904 INFO L93 Difference]: Finished difference Result 845 states and 1285 transitions. [2019-12-07 16:57:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:09,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-12-07 16:57:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:09,906 INFO L225 Difference]: With dead ends: 845 [2019-12-07 16:57:09,906 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 16:57:09,906 INFO L630 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-12-07 16:57:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 16:57:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 381. [2019-12-07 16:57:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-07 16:57:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 576 transitions. [2019-12-07 16:57:09,916 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 576 transitions. Word has length 140 [2019-12-07 16:57:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:09,916 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 576 transitions. [2019-12-07 16:57:09,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 576 transitions. [2019-12-07 16:57:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 16:57:09,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:09,916 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 16:57:09,917 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash -286325528, now seen corresponding path program 1 times [2019-12-07 16:57:09,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:09,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730530310] [2019-12-07 16:57:09,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:09,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730530310] [2019-12-07 16:57:09,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:09,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:09,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766002320] [2019-12-07 16:57:09,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:09,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:09,960 INFO L87 Difference]: Start difference. First operand 381 states and 576 transitions. Second operand 4 states. [2019-12-07 16:57:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:10,241 INFO L93 Difference]: Finished difference Result 830 states and 1263 transitions. [2019-12-07 16:57:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:10,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 16:57:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:10,243 INFO L225 Difference]: With dead ends: 830 [2019-12-07 16:57:10,243 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 16:57:10,244 INFO L630 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-12-07 16:57:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 16:57:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 409. [2019-12-07 16:57:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-12-07 16:57:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 621 transitions. [2019-12-07 16:57:10,253 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 621 transitions. Word has length 142 [2019-12-07 16:57:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:10,253 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 621 transitions. [2019-12-07 16:57:10,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 621 transitions. [2019-12-07 16:57:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 16:57:10,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:10,254 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-12-07 16:57:10,254 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1904869545, now seen corresponding path program 1 times [2019-12-07 16:57:10,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:10,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911861855] [2019-12-07 16:57:10,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:10,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911861855] [2019-12-07 16:57:10,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:10,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:10,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236271114] [2019-12-07 16:57:10,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:10,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:10,293 INFO L87 Difference]: Start difference. First operand 409 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:10,554 INFO L93 Difference]: Finished difference Result 850 states and 1294 transitions. [2019-12-07 16:57:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:10,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 16:57:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:10,556 INFO L225 Difference]: With dead ends: 850 [2019-12-07 16:57:10,556 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 16:57:10,557 INFO L630 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-12-07 16:57:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 16:57:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 410. [2019-12-07 16:57:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 16:57:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 622 transitions. [2019-12-07 16:57:10,566 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 622 transitions. Word has length 143 [2019-12-07 16:57:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:10,567 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 622 transitions. [2019-12-07 16:57:10,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 622 transitions. [2019-12-07 16:57:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 16:57:10,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:10,567 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:10,568 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1246307381, now seen corresponding path program 1 times [2019-12-07 16:57:10,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:10,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934346718] [2019-12-07 16:57:10,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 16:57:10,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934346718] [2019-12-07 16:57:10,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:10,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:10,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287423314] [2019-12-07 16:57:10,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:10,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:10,608 INFO L87 Difference]: Start difference. First operand 410 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:10,875 INFO L93 Difference]: Finished difference Result 851 states and 1294 transitions. [2019-12-07 16:57:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:10,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 16:57:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:10,877 INFO L225 Difference]: With dead ends: 851 [2019-12-07 16:57:10,878 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 16:57:10,878 INFO L630 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-12-07 16:57:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 16:57:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 410. [2019-12-07 16:57:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 16:57:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-12-07 16:57:10,889 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 145 [2019-12-07 16:57:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:10,889 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-12-07 16:57:10,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-12-07 16:57:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 16:57:10,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:10,890 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:10,890 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash 472451220, now seen corresponding path program 1 times [2019-12-07 16:57:10,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:10,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232290673] [2019-12-07 16:57:10,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 16:57:10,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232290673] [2019-12-07 16:57:10,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:10,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:10,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048280263] [2019-12-07 16:57:10,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:10,930 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:11,193 INFO L93 Difference]: Finished difference Result 849 states and 1290 transitions. [2019-12-07 16:57:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:11,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 16:57:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:11,195 INFO L225 Difference]: With dead ends: 849 [2019-12-07 16:57:11,195 INFO L226 Difference]: Without dead ends: 458 [2019-12-07 16:57:11,195 INFO L630 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-12-07 16:57:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-07 16:57:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 410. [2019-12-07 16:57:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 16:57:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 620 transitions. [2019-12-07 16:57:11,205 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 620 transitions. Word has length 146 [2019-12-07 16:57:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:11,205 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 620 transitions. [2019-12-07 16:57:11,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 620 transitions. [2019-12-07 16:57:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 16:57:11,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:11,206 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1] [2019-12-07 16:57:11,206 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1909536624, now seen corresponding path program 1 times [2019-12-07 16:57:11,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:11,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637534337] [2019-12-07 16:57:11,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:11,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637534337] [2019-12-07 16:57:11,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:11,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:11,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795540736] [2019-12-07 16:57:11,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:11,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:11,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:11,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:11,248 INFO L87 Difference]: Start difference. First operand 410 states and 620 transitions. Second operand 4 states. [2019-12-07 16:57:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:11,514 INFO L93 Difference]: Finished difference Result 846 states and 1284 transitions. [2019-12-07 16:57:11,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:11,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 16:57:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:11,516 INFO L225 Difference]: With dead ends: 846 [2019-12-07 16:57:11,516 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 16:57:11,516 INFO L630 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-12-07 16:57:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 16:57:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 413. [2019-12-07 16:57:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 16:57:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 625 transitions. [2019-12-07 16:57:11,526 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 625 transitions. Word has length 146 [2019-12-07 16:57:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:11,526 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 625 transitions. [2019-12-07 16:57:11,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 625 transitions. [2019-12-07 16:57:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 16:57:11,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:11,527 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:11,527 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash 546763847, now seen corresponding path program 1 times [2019-12-07 16:57:11,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:11,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070153907] [2019-12-07 16:57:11,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 16:57:11,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070153907] [2019-12-07 16:57:11,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:11,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:11,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429251933] [2019-12-07 16:57:11,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:11,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:11,566 INFO L87 Difference]: Start difference. First operand 413 states and 625 transitions. Second operand 4 states. [2019-12-07 16:57:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:11,821 INFO L93 Difference]: Finished difference Result 841 states and 1274 transitions. [2019-12-07 16:57:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:11,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 16:57:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:11,823 INFO L225 Difference]: With dead ends: 841 [2019-12-07 16:57:11,823 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 16:57:11,824 INFO L630 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-12-07 16:57:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 16:57:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 413. [2019-12-07 16:57:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 16:57:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 624 transitions. [2019-12-07 16:57:11,834 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 624 transitions. Word has length 146 [2019-12-07 16:57:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:11,834 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 624 transitions. [2019-12-07 16:57:11,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 624 transitions. [2019-12-07 16:57:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 16:57:11,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:11,835 INFO L410 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, 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] [2019-12-07 16:57:11,835 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1237117711, now seen corresponding path program 1 times [2019-12-07 16:57:11,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:11,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236232487] [2019-12-07 16:57:11,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:11,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236232487] [2019-12-07 16:57:11,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:11,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:11,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583160597] [2019-12-07 16:57:11,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:11,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:11,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:11,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:11,878 INFO L87 Difference]: Start difference. First operand 413 states and 624 transitions. Second operand 4 states. [2019-12-07 16:57:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:12,169 INFO L93 Difference]: Finished difference Result 862 states and 1305 transitions. [2019-12-07 16:57:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:12,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 16:57:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:12,171 INFO L225 Difference]: With dead ends: 862 [2019-12-07 16:57:12,171 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 16:57:12,171 INFO L630 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-12-07 16:57:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 16:57:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 413. [2019-12-07 16:57:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 16:57:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 623 transitions. [2019-12-07 16:57:12,182 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 623 transitions. Word has length 147 [2019-12-07 16:57:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:12,182 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 623 transitions. [2019-12-07 16:57:12,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 623 transitions. [2019-12-07 16:57:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 16:57:12,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:12,183 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:12,183 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1867222888, now seen corresponding path program 1 times [2019-12-07 16:57:12,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:12,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652525680] [2019-12-07 16:57:12,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 16:57:12,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652525680] [2019-12-07 16:57:12,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:12,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:12,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714934116] [2019-12-07 16:57:12,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:12,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:12,222 INFO L87 Difference]: Start difference. First operand 413 states and 623 transitions. Second operand 4 states. [2019-12-07 16:57:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:12,476 INFO L93 Difference]: Finished difference Result 841 states and 1270 transitions. [2019-12-07 16:57:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:12,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 16:57:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:12,477 INFO L225 Difference]: With dead ends: 841 [2019-12-07 16:57:12,477 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 16:57:12,478 INFO L630 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-12-07 16:57:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 16:57:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 413. [2019-12-07 16:57:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 16:57:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 622 transitions. [2019-12-07 16:57:12,491 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 622 transitions. Word has length 147 [2019-12-07 16:57:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:12,491 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 622 transitions. [2019-12-07 16:57:12,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 622 transitions. [2019-12-07 16:57:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 16:57:12,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:12,492 INFO L410 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, 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] [2019-12-07 16:57:12,492 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1886969698, now seen corresponding path program 1 times [2019-12-07 16:57:12,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:12,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506434355] [2019-12-07 16:57:12,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:12,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506434355] [2019-12-07 16:57:12,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:12,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:12,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725030968] [2019-12-07 16:57:12,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:12,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:12,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:12,535 INFO L87 Difference]: Start difference. First operand 413 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:12,806 INFO L93 Difference]: Finished difference Result 854 states and 1288 transitions. [2019-12-07 16:57:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:12,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 16:57:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:12,807 INFO L225 Difference]: With dead ends: 854 [2019-12-07 16:57:12,807 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 16:57:12,808 INFO L630 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-12-07 16:57:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 16:57:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 413. [2019-12-07 16:57:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 16:57:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2019-12-07 16:57:12,818 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 148 [2019-12-07 16:57:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:12,819 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2019-12-07 16:57:12,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2019-12-07 16:57:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 16:57:12,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:12,819 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1] [2019-12-07 16:57:12,820 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash 393687759, now seen corresponding path program 1 times [2019-12-07 16:57:12,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:12,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436841892] [2019-12-07 16:57:12,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:12,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436841892] [2019-12-07 16:57:12,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:12,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:12,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537328801] [2019-12-07 16:57:12,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:12,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:12,863 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:13,096 INFO L93 Difference]: Finished difference Result 849 states and 1280 transitions. [2019-12-07 16:57:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:13,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 16:57:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:13,097 INFO L225 Difference]: With dead ends: 849 [2019-12-07 16:57:13,097 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 16:57:13,098 INFO L630 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-12-07 16:57:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 16:57:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 414. [2019-12-07 16:57:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 16:57:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 622 transitions. [2019-12-07 16:57:13,109 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 622 transitions. Word has length 148 [2019-12-07 16:57:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:13,109 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 622 transitions. [2019-12-07 16:57:13,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 622 transitions. [2019-12-07 16:57:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 16:57:13,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:13,110 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:13,110 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1873362348, now seen corresponding path program 1 times [2019-12-07 16:57:13,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:13,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213858363] [2019-12-07 16:57:13,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 16:57:13,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213858363] [2019-12-07 16:57:13,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:13,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474976026] [2019-12-07 16:57:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:13,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:13,150 INFO L87 Difference]: Start difference. First operand 414 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:13,425 INFO L93 Difference]: Finished difference Result 843 states and 1268 transitions. [2019-12-07 16:57:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:13,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 16:57:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:13,426 INFO L225 Difference]: With dead ends: 843 [2019-12-07 16:57:13,426 INFO L226 Difference]: Without dead ends: 448 [2019-12-07 16:57:13,427 INFO L630 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-12-07 16:57:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-12-07 16:57:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 414. [2019-12-07 16:57:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 16:57:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 621 transitions. [2019-12-07 16:57:13,438 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 621 transitions. Word has length 148 [2019-12-07 16:57:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:13,438 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 621 transitions. [2019-12-07 16:57:13,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 621 transitions. [2019-12-07 16:57:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 16:57:13,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:13,439 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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-12-07 16:57:13,439 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1855286443, now seen corresponding path program 1 times [2019-12-07 16:57:13,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:13,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422283730] [2019-12-07 16:57:13,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:13,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422283730] [2019-12-07 16:57:13,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:13,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:13,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304186777] [2019-12-07 16:57:13,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:13,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:13,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:13,482 INFO L87 Difference]: Start difference. First operand 414 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:13,730 INFO L93 Difference]: Finished difference Result 846 states and 1273 transitions. [2019-12-07 16:57:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:13,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 16:57:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:13,731 INFO L225 Difference]: With dead ends: 846 [2019-12-07 16:57:13,731 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:57:13,732 INFO L630 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-12-07 16:57:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:57:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 415. [2019-12-07 16:57:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-12-07 16:57:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 622 transitions. [2019-12-07 16:57:13,743 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 622 transitions. Word has length 149 [2019-12-07 16:57:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:13,743 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 622 transitions. [2019-12-07 16:57:13,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 622 transitions. [2019-12-07 16:57:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 16:57:13,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:13,744 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-12-07 16:57:13,744 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 763725817, now seen corresponding path program 1 times [2019-12-07 16:57:13,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:13,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702996260] [2019-12-07 16:57:13,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:13,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702996260] [2019-12-07 16:57:13,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:13,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:13,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308673731] [2019-12-07 16:57:13,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:13,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:13,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:13,787 INFO L87 Difference]: Start difference. First operand 415 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,070 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2019-12-07 16:57:14,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:14,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 16:57:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,071 INFO L225 Difference]: With dead ends: 847 [2019-12-07 16:57:14,071 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:57:14,071 INFO L630 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-12-07 16:57:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:57:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 416. [2019-12-07 16:57:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 16:57:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 623 transitions. [2019-12-07 16:57:14,083 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 623 transitions. Word has length 149 [2019-12-07 16:57:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,083 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 623 transitions. [2019-12-07 16:57:14,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 623 transitions. [2019-12-07 16:57:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 16:57:14,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,084 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:14,084 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1162816931, now seen corresponding path program 1 times [2019-12-07 16:57:14,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:14,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105411605] [2019-12-07 16:57:14,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 16:57:14,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105411605] [2019-12-07 16:57:14,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:14,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:14,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405340681] [2019-12-07 16:57:14,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:14,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:14,124 INFO L87 Difference]: Start difference. First operand 416 states and 623 transitions. Second operand 4 states. [2019-12-07 16:57:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,382 INFO L93 Difference]: Finished difference Result 837 states and 1258 transitions. [2019-12-07 16:57:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:14,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 16:57:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,383 INFO L225 Difference]: With dead ends: 837 [2019-12-07 16:57:14,383 INFO L226 Difference]: Without dead ends: 440 [2019-12-07 16:57:14,384 INFO L630 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-12-07 16:57:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-07 16:57:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 416. [2019-12-07 16:57:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 16:57:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 622 transitions. [2019-12-07 16:57:14,395 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 622 transitions. Word has length 149 [2019-12-07 16:57:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,395 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 622 transitions. [2019-12-07 16:57:14,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 622 transitions. [2019-12-07 16:57:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 16:57:14,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,396 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:14,396 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1224423598, now seen corresponding path program 1 times [2019-12-07 16:57:14,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:14,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512250307] [2019-12-07 16:57:14,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:57:14,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512250307] [2019-12-07 16:57:14,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:14,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:14,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915459720] [2019-12-07 16:57:14,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:14,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:14,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:14,446 INFO L87 Difference]: Start difference. First operand 416 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,710 INFO L93 Difference]: Finished difference Result 857 states and 1282 transitions. [2019-12-07 16:57:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:14,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 16:57:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,711 INFO L225 Difference]: With dead ends: 857 [2019-12-07 16:57:14,711 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 16:57:14,711 INFO L630 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-12-07 16:57:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 16:57:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 416. [2019-12-07 16:57:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 16:57:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 621 transitions. [2019-12-07 16:57:14,723 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 621 transitions. Word has length 150 [2019-12-07 16:57:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,723 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 621 transitions. [2019-12-07 16:57:14,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 621 transitions. [2019-12-07 16:57:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 16:57:14,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,724 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:14,724 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1639355843, now seen corresponding path program 1 times [2019-12-07 16:57:14,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:14,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629059920] [2019-12-07 16:57:14,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:14,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629059920] [2019-12-07 16:57:14,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:14,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:14,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960355636] [2019-12-07 16:57:14,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:14,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:14,766 INFO L87 Difference]: Start difference. First operand 416 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,995 INFO L93 Difference]: Finished difference Result 846 states and 1267 transitions. [2019-12-07 16:57:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:14,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 16:57:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,996 INFO L225 Difference]: With dead ends: 846 [2019-12-07 16:57:14,996 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 16:57:14,997 INFO L630 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-12-07 16:57:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 16:57:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 417. [2019-12-07 16:57:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 16:57:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2019-12-07 16:57:15,008 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 150 [2019-12-07 16:57:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:15,008 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2019-12-07 16:57:15,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2019-12-07 16:57:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 16:57:15,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:15,009 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:15,009 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash -205946053, now seen corresponding path program 1 times [2019-12-07 16:57:15,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:15,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962589858] [2019-12-07 16:57:15,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:57:15,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962589858] [2019-12-07 16:57:15,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:15,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:15,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875470583] [2019-12-07 16:57:15,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:15,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:15,049 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:15,316 INFO L93 Difference]: Finished difference Result 856 states and 1278 transitions. [2019-12-07 16:57:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:15,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 16:57:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:15,317 INFO L225 Difference]: With dead ends: 856 [2019-12-07 16:57:15,317 INFO L226 Difference]: Without dead ends: 458 [2019-12-07 16:57:15,318 INFO L630 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-12-07 16:57:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-07 16:57:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 417. [2019-12-07 16:57:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 16:57:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 621 transitions. [2019-12-07 16:57:15,331 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 621 transitions. Word has length 151 [2019-12-07 16:57:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:15,332 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 621 transitions. [2019-12-07 16:57:15,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 621 transitions. [2019-12-07 16:57:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 16:57:15,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:15,333 INFO L410 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, 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-12-07 16:57:15,333 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1231139351, now seen corresponding path program 1 times [2019-12-07 16:57:15,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:15,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008139001] [2019-12-07 16:57:15,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:15,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008139001] [2019-12-07 16:57:15,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:15,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:15,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65107261] [2019-12-07 16:57:15,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:15,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:15,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:15,379 INFO L87 Difference]: Start difference. First operand 417 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:15,641 INFO L93 Difference]: Finished difference Result 853 states and 1272 transitions. [2019-12-07 16:57:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:15,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 16:57:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:15,642 INFO L225 Difference]: With dead ends: 853 [2019-12-07 16:57:15,642 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 16:57:15,642 INFO L630 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-12-07 16:57:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 16:57:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 417. [2019-12-07 16:57:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 16:57:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2019-12-07 16:57:15,656 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 151 [2019-12-07 16:57:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:15,657 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2019-12-07 16:57:15,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2019-12-07 16:57:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 16:57:15,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:15,657 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-12-07 16:57:15,658 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash -436535202, now seen corresponding path program 1 times [2019-12-07 16:57:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:15,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582421530] [2019-12-07 16:57:15,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:15,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582421530] [2019-12-07 16:57:15,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:15,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:15,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247300516] [2019-12-07 16:57:15,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:15,700 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2019-12-07 16:57:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:15,939 INFO L93 Difference]: Finished difference Result 847 states and 1263 transitions. [2019-12-07 16:57:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:15,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 16:57:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:15,940 INFO L225 Difference]: With dead ends: 847 [2019-12-07 16:57:15,940 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 16:57:15,941 INFO L630 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-12-07 16:57:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 16:57:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 418. [2019-12-07 16:57:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 16:57:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2019-12-07 16:57:15,955 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 151 [2019-12-07 16:57:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:15,955 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2019-12-07 16:57:15,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2019-12-07 16:57:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 16:57:15,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:15,956 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1] [2019-12-07 16:57:15,956 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 426394178, now seen corresponding path program 1 times [2019-12-07 16:57:15,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:15,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027489017] [2019-12-07 16:57:15,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:16,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027489017] [2019-12-07 16:57:16,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:16,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:16,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705542079] [2019-12-07 16:57:16,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:16,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:16,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:16,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:16,008 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:16,264 INFO L93 Difference]: Finished difference Result 846 states and 1261 transitions. [2019-12-07 16:57:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:16,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 16:57:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:16,265 INFO L225 Difference]: With dead ends: 846 [2019-12-07 16:57:16,265 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 16:57:16,265 INFO L630 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-12-07 16:57:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 16:57:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 419. [2019-12-07 16:57:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 16:57:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 622 transitions. [2019-12-07 16:57:16,277 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 622 transitions. Word has length 152 [2019-12-07 16:57:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:16,277 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 622 transitions. [2019-12-07 16:57:16,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 622 transitions. [2019-12-07 16:57:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 16:57:16,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:16,278 INFO L410 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, 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-12-07 16:57:16,278 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1288937398, now seen corresponding path program 1 times [2019-12-07 16:57:16,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:16,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874517268] [2019-12-07 16:57:16,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:16,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874517268] [2019-12-07 16:57:16,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:16,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:16,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085418943] [2019-12-07 16:57:16,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:16,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:16,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:16,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:16,321 INFO L87 Difference]: Start difference. First operand 419 states and 622 transitions. Second operand 4 states. [2019-12-07 16:57:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:16,589 INFO L93 Difference]: Finished difference Result 855 states and 1270 transitions. [2019-12-07 16:57:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:16,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 16:57:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:16,590 INFO L225 Difference]: With dead ends: 855 [2019-12-07 16:57:16,590 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 16:57:16,590 INFO L630 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-12-07 16:57:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 16:57:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 419. [2019-12-07 16:57:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 16:57:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 621 transitions. [2019-12-07 16:57:16,607 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 621 transitions. Word has length 153 [2019-12-07 16:57:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:16,607 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 621 transitions. [2019-12-07 16:57:16,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 621 transitions. [2019-12-07 16:57:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 16:57:16,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:16,608 INFO L410 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, 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-12-07 16:57:16,608 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash -456745820, now seen corresponding path program 1 times [2019-12-07 16:57:16,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:16,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891576412] [2019-12-07 16:57:16,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:16,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891576412] [2019-12-07 16:57:16,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:16,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:16,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250702640] [2019-12-07 16:57:16,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:16,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:16,652 INFO L87 Difference]: Start difference. First operand 419 states and 621 transitions. Second operand 4 states. [2019-12-07 16:57:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:16,896 INFO L93 Difference]: Finished difference Result 851 states and 1263 transitions. [2019-12-07 16:57:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:16,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 16:57:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:16,897 INFO L225 Difference]: With dead ends: 851 [2019-12-07 16:57:16,897 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:57:16,898 INFO L630 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-12-07 16:57:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:57:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 419. [2019-12-07 16:57:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 16:57:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 620 transitions. [2019-12-07 16:57:16,910 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 620 transitions. Word has length 154 [2019-12-07 16:57:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:16,910 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 620 transitions. [2019-12-07 16:57:16,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 620 transitions. [2019-12-07 16:57:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 16:57:16,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:16,911 INFO L410 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, 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-12-07 16:57:16,911 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:16,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1548306446, now seen corresponding path program 1 times [2019-12-07 16:57:16,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:16,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998438973] [2019-12-07 16:57:16,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:16,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998438973] [2019-12-07 16:57:16,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:16,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:16,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106949118] [2019-12-07 16:57:16,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:16,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:16,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:16,955 INFO L87 Difference]: Start difference. First operand 419 states and 620 transitions. Second operand 4 states. [2019-12-07 16:57:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:17,221 INFO L93 Difference]: Finished difference Result 851 states and 1261 transitions. [2019-12-07 16:57:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:17,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 16:57:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:17,222 INFO L225 Difference]: With dead ends: 851 [2019-12-07 16:57:17,222 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:57:17,222 INFO L630 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-12-07 16:57:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:57:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 419. [2019-12-07 16:57:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 16:57:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 619 transitions. [2019-12-07 16:57:17,235 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 619 transitions. Word has length 154 [2019-12-07 16:57:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 619 transitions. [2019-12-07 16:57:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 619 transitions. [2019-12-07 16:57:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 16:57:17,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:17,236 INFO L410 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, 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-12-07 16:57:17,236 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash -297911964, now seen corresponding path program 1 times [2019-12-07 16:57:17,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:17,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667124555] [2019-12-07 16:57:17,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:17,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667124555] [2019-12-07 16:57:17,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:17,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:17,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363314773] [2019-12-07 16:57:17,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:17,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:17,280 INFO L87 Difference]: Start difference. First operand 419 states and 619 transitions. Second operand 4 states. [2019-12-07 16:57:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:17,537 INFO L93 Difference]: Finished difference Result 849 states and 1257 transitions. [2019-12-07 16:57:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:17,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 16:57:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:17,538 INFO L225 Difference]: With dead ends: 849 [2019-12-07 16:57:17,538 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 16:57:17,538 INFO L630 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-12-07 16:57:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 16:57:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 419. [2019-12-07 16:57:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 16:57:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 618 transitions. [2019-12-07 16:57:17,551 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 618 transitions. Word has length 155 [2019-12-07 16:57:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:17,551 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 618 transitions. [2019-12-07 16:57:17,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 618 transitions. [2019-12-07 16:57:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 16:57:17,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:17,552 INFO L410 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, 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-12-07 16:57:17,552 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:17,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:17,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1801447913, now seen corresponding path program 1 times [2019-12-07 16:57:17,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:17,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310255881] [2019-12-07 16:57:17,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:17,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310255881] [2019-12-07 16:57:17,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:17,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:17,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586796496] [2019-12-07 16:57:17,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:17,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:17,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:17,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:17,596 INFO L87 Difference]: Start difference. First operand 419 states and 618 transitions. Second operand 4 states. [2019-12-07 16:57:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:17,839 INFO L93 Difference]: Finished difference Result 849 states and 1255 transitions. [2019-12-07 16:57:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:17,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 16:57:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:17,840 INFO L225 Difference]: With dead ends: 849 [2019-12-07 16:57:17,840 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 16:57:17,840 INFO L630 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-12-07 16:57:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 16:57:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 419. [2019-12-07 16:57:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 16:57:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 617 transitions. [2019-12-07 16:57:17,853 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 617 transitions. Word has length 156 [2019-12-07 16:57:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:17,853 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 617 transitions. [2019-12-07 16:57:17,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 617 transitions. [2019-12-07 16:57:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 16:57:17,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:17,854 INFO L410 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] [2019-12-07 16:57:17,854 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash -382312384, now seen corresponding path program 1 times [2019-12-07 16:57:17,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:17,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405145487] [2019-12-07 16:57:17,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:17,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405145487] [2019-12-07 16:57:17,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:17,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:17,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545936075] [2019-12-07 16:57:17,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:17,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:17,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:17,908 INFO L87 Difference]: Start difference. First operand 419 states and 617 transitions. Second operand 4 states. [2019-12-07 16:57:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:18,203 INFO L93 Difference]: Finished difference Result 885 states and 1314 transitions. [2019-12-07 16:57:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:18,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 16:57:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:18,204 INFO L225 Difference]: With dead ends: 885 [2019-12-07 16:57:18,204 INFO L226 Difference]: Without dead ends: 485 [2019-12-07 16:57:18,204 INFO L630 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-12-07 16:57:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-12-07 16:57:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 449. [2019-12-07 16:57:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 16:57:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 670 transitions. [2019-12-07 16:57:18,218 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 670 transitions. Word has length 156 [2019-12-07 16:57:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:18,218 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 670 transitions. [2019-12-07 16:57:18,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 670 transitions. [2019-12-07 16:57:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 16:57:18,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:18,219 INFO L410 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, 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-12-07 16:57:18,219 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:18,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1063773097, now seen corresponding path program 1 times [2019-12-07 16:57:18,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:18,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547967994] [2019-12-07 16:57:18,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:18,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547967994] [2019-12-07 16:57:18,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:18,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:18,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149412497] [2019-12-07 16:57:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:18,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:18,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:18,264 INFO L87 Difference]: Start difference. First operand 449 states and 670 transitions. Second operand 4 states. [2019-12-07 16:57:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:18,527 INFO L93 Difference]: Finished difference Result 907 states and 1357 transitions. [2019-12-07 16:57:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:18,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 16:57:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:18,528 INFO L225 Difference]: With dead ends: 907 [2019-12-07 16:57:18,528 INFO L226 Difference]: Without dead ends: 477 [2019-12-07 16:57:18,528 INFO L630 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-12-07 16:57:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-12-07 16:57:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 411. [2019-12-07 16:57:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-07 16:57:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2019-12-07 16:57:18,542 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 157 [2019-12-07 16:57:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:18,542 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2019-12-07 16:57:18,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2019-12-07 16:57:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 16:57:18,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:18,543 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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] [2019-12-07 16:57:18,543 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash -626374414, now seen corresponding path program 1 times [2019-12-07 16:57:18,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:18,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615601416] [2019-12-07 16:57:18,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 16:57:18,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615601416] [2019-12-07 16:57:18,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:18,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:18,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090315187] [2019-12-07 16:57:18,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:18,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:18,586 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2019-12-07 16:57:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:18,831 INFO L93 Difference]: Finished difference Result 869 states and 1300 transitions. [2019-12-07 16:57:18,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:18,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 16:57:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:18,832 INFO L225 Difference]: With dead ends: 869 [2019-12-07 16:57:18,832 INFO L226 Difference]: Without dead ends: 477 [2019-12-07 16:57:18,833 INFO L630 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-12-07 16:57:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-12-07 16:57:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 441. [2019-12-07 16:57:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-07 16:57:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 659 transitions. [2019-12-07 16:57:18,847 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 659 transitions. Word has length 159 [2019-12-07 16:57:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:18,847 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 659 transitions. [2019-12-07 16:57:18,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 659 transitions. [2019-12-07 16:57:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 16:57:18,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:18,848 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:18,848 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:18,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2144867875, now seen corresponding path program 1 times [2019-12-07 16:57:18,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:18,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559527716] [2019-12-07 16:57:18,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 16:57:18,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559527716] [2019-12-07 16:57:18,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:18,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:18,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626265582] [2019-12-07 16:57:18,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:18,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:18,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:18,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:18,889 INFO L87 Difference]: Start difference. First operand 441 states and 659 transitions. Second operand 4 states. [2019-12-07 16:57:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:19,148 INFO L93 Difference]: Finished difference Result 887 states and 1330 transitions. [2019-12-07 16:57:19,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:19,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 16:57:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:19,149 INFO L225 Difference]: With dead ends: 887 [2019-12-07 16:57:19,149 INFO L226 Difference]: Without dead ends: 465 [2019-12-07 16:57:19,149 INFO L630 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-12-07 16:57:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-12-07 16:57:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 441. [2019-12-07 16:57:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-07 16:57:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 658 transitions. [2019-12-07 16:57:19,163 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 658 transitions. Word has length 159 [2019-12-07 16:57:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:19,164 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 658 transitions. [2019-12-07 16:57:19,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 658 transitions. [2019-12-07 16:57:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 16:57:19,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:19,164 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:19,165 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1678511439, now seen corresponding path program 1 times [2019-12-07 16:57:19,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:19,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668587421] [2019-12-07 16:57:19,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 16:57:19,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668587421] [2019-12-07 16:57:19,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:19,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:19,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336734236] [2019-12-07 16:57:19,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:19,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:19,209 INFO L87 Difference]: Start difference. First operand 441 states and 658 transitions. Second operand 4 states. [2019-12-07 16:57:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:19,445 INFO L93 Difference]: Finished difference Result 897 states and 1340 transitions. [2019-12-07 16:57:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:19,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 16:57:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:19,446 INFO L225 Difference]: With dead ends: 897 [2019-12-07 16:57:19,446 INFO L226 Difference]: Without dead ends: 475 [2019-12-07 16:57:19,446 INFO L630 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-12-07 16:57:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-07 16:57:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 442. [2019-12-07 16:57:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-12-07 16:57:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 659 transitions. [2019-12-07 16:57:19,460 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 659 transitions. Word has length 160 [2019-12-07 16:57:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:19,460 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 659 transitions. [2019-12-07 16:57:19,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 659 transitions. [2019-12-07 16:57:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 16:57:19,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:19,461 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:19,461 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1401777821, now seen corresponding path program 1 times [2019-12-07 16:57:19,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:19,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507345839] [2019-12-07 16:57:19,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 16:57:19,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507345839] [2019-12-07 16:57:19,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:19,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:19,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273132292] [2019-12-07 16:57:19,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:19,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:19,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:19,504 INFO L87 Difference]: Start difference. First operand 442 states and 659 transitions. Second operand 3 states. [2019-12-07 16:57:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:19,555 INFO L93 Difference]: Finished difference Result 1284 states and 1928 transitions. [2019-12-07 16:57:19,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:19,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-12-07 16:57:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:19,556 INFO L225 Difference]: With dead ends: 1284 [2019-12-07 16:57:19,556 INFO L226 Difference]: Without dead ends: 861 [2019-12-07 16:57:19,557 INFO L630 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-12-07 16:57:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-07 16:57:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 859. [2019-12-07 16:57:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 16:57:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1283 transitions. [2019-12-07 16:57:19,596 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1283 transitions. Word has length 160 [2019-12-07 16:57:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:19,596 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1283 transitions. [2019-12-07 16:57:19,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1283 transitions. [2019-12-07 16:57:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 16:57:19,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:19,597 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:19,597 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1574766612, now seen corresponding path program 1 times [2019-12-07 16:57:19,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:19,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571688832] [2019-12-07 16:57:19,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 16:57:19,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571688832] [2019-12-07 16:57:19,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:19,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:19,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484670229] [2019-12-07 16:57:19,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:19,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:19,639 INFO L87 Difference]: Start difference. First operand 859 states and 1283 transitions. Second operand 4 states. [2019-12-07 16:57:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:19,918 INFO L93 Difference]: Finished difference Result 1743 states and 2608 transitions. [2019-12-07 16:57:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:19,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 16:57:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:19,920 INFO L225 Difference]: With dead ends: 1743 [2019-12-07 16:57:19,920 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 16:57:19,920 INFO L630 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-12-07 16:57:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 16:57:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 859. [2019-12-07 16:57:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 16:57:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1281 transitions. [2019-12-07 16:57:19,948 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1281 transitions. Word has length 160 [2019-12-07 16:57:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:19,948 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1281 transitions. [2019-12-07 16:57:19,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1281 transitions. [2019-12-07 16:57:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 16:57:19,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:19,949 INFO L410 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] [2019-12-07 16:57:19,949 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1156991326, now seen corresponding path program 1 times [2019-12-07 16:57:19,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413666501] [2019-12-07 16:57:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:20,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413666501] [2019-12-07 16:57:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:57:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590280335] [2019-12-07 16:57:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:20,045 INFO L87 Difference]: Start difference. First operand 859 states and 1281 transitions. Second operand 5 states. [2019-12-07 16:57:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:20,541 INFO L93 Difference]: Finished difference Result 1851 states and 2774 transitions. [2019-12-07 16:57:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:57:20,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-12-07 16:57:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:20,543 INFO L225 Difference]: With dead ends: 1851 [2019-12-07 16:57:20,543 INFO L226 Difference]: Without dead ends: 1011 [2019-12-07 16:57:20,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:57:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-07 16:57:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 925. [2019-12-07 16:57:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-12-07 16:57:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1399 transitions. [2019-12-07 16:57:20,580 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1399 transitions. Word has length 161 [2019-12-07 16:57:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:20,580 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1399 transitions. [2019-12-07 16:57:20,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1399 transitions. [2019-12-07 16:57:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 16:57:20,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:20,581 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:20,581 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1767609500, now seen corresponding path program 1 times [2019-12-07 16:57:20,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:20,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765144129] [2019-12-07 16:57:20,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:20,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765144129] [2019-12-07 16:57:20,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:20,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:20,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680974340] [2019-12-07 16:57:20,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:20,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:20,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:20,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:20,633 INFO L87 Difference]: Start difference. First operand 925 states and 1399 transitions. Second operand 4 states. [2019-12-07 16:57:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:20,960 INFO L93 Difference]: Finished difference Result 1897 states and 2861 transitions. [2019-12-07 16:57:20,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:20,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 16:57:20,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:20,962 INFO L225 Difference]: With dead ends: 1897 [2019-12-07 16:57:20,962 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 16:57:20,962 INFO L630 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-12-07 16:57:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 16:57:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-07 16:57:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-07 16:57:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1427 transitions. [2019-12-07 16:57:21,000 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1427 transitions. Word has length 162 [2019-12-07 16:57:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:21,000 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 1427 transitions. [2019-12-07 16:57:21,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1427 transitions. [2019-12-07 16:57:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 16:57:21,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:21,001 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:21,002 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 321289816, now seen corresponding path program 1 times [2019-12-07 16:57:21,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:21,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732000643] [2019-12-07 16:57:21,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 16:57:21,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732000643] [2019-12-07 16:57:21,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:21,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:21,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856648474] [2019-12-07 16:57:21,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:21,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:21,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:21,068 INFO L87 Difference]: Start difference. First operand 949 states and 1427 transitions. Second operand 4 states. [2019-12-07 16:57:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:21,350 INFO L93 Difference]: Finished difference Result 1911 states and 2874 transitions. [2019-12-07 16:57:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:21,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 16:57:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:21,351 INFO L225 Difference]: With dead ends: 1911 [2019-12-07 16:57:21,351 INFO L226 Difference]: Without dead ends: 977 [2019-12-07 16:57:21,352 INFO L630 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-12-07 16:57:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-12-07 16:57:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 947. [2019-12-07 16:57:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 16:57:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1423 transitions. [2019-12-07 16:57:21,380 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1423 transitions. Word has length 163 [2019-12-07 16:57:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:21,380 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1423 transitions. [2019-12-07 16:57:21,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1423 transitions. [2019-12-07 16:57:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 16:57:21,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:21,381 INFO L410 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, 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, 1, 1, 1, 1] [2019-12-07 16:57:21,381 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -690055765, now seen corresponding path program 1 times [2019-12-07 16:57:21,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:21,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320867930] [2019-12-07 16:57:21,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:57:21,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320867930] [2019-12-07 16:57:21,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:21,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195605087] [2019-12-07 16:57:21,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:21,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:21,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:21,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:21,428 INFO L87 Difference]: Start difference. First operand 947 states and 1423 transitions. Second operand 4 states. [2019-12-07 16:57:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:21,698 INFO L93 Difference]: Finished difference Result 1927 states and 2895 transitions. [2019-12-07 16:57:21,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:21,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 16:57:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:21,699 INFO L225 Difference]: With dead ends: 1927 [2019-12-07 16:57:21,699 INFO L226 Difference]: Without dead ends: 999 [2019-12-07 16:57:21,699 INFO L630 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-12-07 16:57:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-07 16:57:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 947. [2019-12-07 16:57:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 16:57:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1421 transitions. [2019-12-07 16:57:21,728 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1421 transitions. Word has length 164 [2019-12-07 16:57:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:21,728 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1421 transitions. [2019-12-07 16:57:21,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1421 transitions. [2019-12-07 16:57:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 16:57:21,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:21,729 INFO L410 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, 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, 1, 1, 1, 1] [2019-12-07 16:57:21,729 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 642333976, now seen corresponding path program 1 times [2019-12-07 16:57:21,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:21,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700069189] [2019-12-07 16:57:21,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:57:21,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700069189] [2019-12-07 16:57:21,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:21,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:21,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273897771] [2019-12-07 16:57:21,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:21,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:21,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:21,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:21,792 INFO L87 Difference]: Start difference. First operand 947 states and 1421 transitions. Second operand 4 states. [2019-12-07 16:57:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:22,078 INFO L93 Difference]: Finished difference Result 1923 states and 2887 transitions. [2019-12-07 16:57:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:22,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 16:57:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:22,079 INFO L225 Difference]: With dead ends: 1923 [2019-12-07 16:57:22,080 INFO L226 Difference]: Without dead ends: 995 [2019-12-07 16:57:22,080 INFO L630 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-12-07 16:57:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-12-07 16:57:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 947. [2019-12-07 16:57:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 16:57:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1419 transitions. [2019-12-07 16:57:22,114 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1419 transitions. Word has length 165 [2019-12-07 16:57:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:22,114 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1419 transitions. [2019-12-07 16:57:22,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1419 transitions. [2019-12-07 16:57:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 16:57:22,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:22,115 INFO L410 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, 1] [2019-12-07 16:57:22,115 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash 919067594, now seen corresponding path program 1 times [2019-12-07 16:57:22,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:22,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748976542] [2019-12-07 16:57:22,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 16:57:22,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748976542] [2019-12-07 16:57:22,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:22,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878988100] [2019-12-07 16:57:22,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:22,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:22,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:22,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:22,165 INFO L87 Difference]: Start difference. First operand 947 states and 1419 transitions. Second operand 3 states. [2019-12-07 16:57:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:22,245 INFO L93 Difference]: Finished difference Result 2335 states and 3513 transitions. [2019-12-07 16:57:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:22,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 16:57:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:22,246 INFO L225 Difference]: With dead ends: 2335 [2019-12-07 16:57:22,246 INFO L226 Difference]: Without dead ends: 1407 [2019-12-07 16:57:22,247 INFO L630 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-12-07 16:57:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-12-07 16:57:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2019-12-07 16:57:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2019-12-07 16:57:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2107 transitions. [2019-12-07 16:57:22,291 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2107 transitions. Word has length 165 [2019-12-07 16:57:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:22,292 INFO L462 AbstractCegarLoop]: Abstraction has 1407 states and 2107 transitions. [2019-12-07 16:57:22,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2107 transitions. [2019-12-07 16:57:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 16:57:22,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:22,293 INFO L410 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, 1, 1] [2019-12-07 16:57:22,293 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 152025175, now seen corresponding path program 1 times [2019-12-07 16:57:22,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:22,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717821278] [2019-12-07 16:57:22,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:57:22,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717821278] [2019-12-07 16:57:22,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:22,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:22,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823111897] [2019-12-07 16:57:22,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:22,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:22,336 INFO L87 Difference]: Start difference. First operand 1407 states and 2107 transitions. Second operand 3 states. [2019-12-07 16:57:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:22,445 INFO L93 Difference]: Finished difference Result 3253 states and 4884 transitions. [2019-12-07 16:57:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:22,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 16:57:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:22,446 INFO L225 Difference]: With dead ends: 3253 [2019-12-07 16:57:22,446 INFO L226 Difference]: Without dead ends: 1865 [2019-12-07 16:57:22,447 INFO L630 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-12-07 16:57:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2019-12-07 16:57:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1860. [2019-12-07 16:57:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-12-07 16:57:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2787 transitions. [2019-12-07 16:57:22,506 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2787 transitions. Word has length 166 [2019-12-07 16:57:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:22,506 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 2787 transitions. [2019-12-07 16:57:22,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2787 transitions. [2019-12-07 16:57:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 16:57:22,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:22,507 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:22,507 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash 594642172, now seen corresponding path program 1 times [2019-12-07 16:57:22,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:22,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490254019] [2019-12-07 16:57:22,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 16:57:22,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490254019] [2019-12-07 16:57:22,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:22,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:22,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474654720] [2019-12-07 16:57:22,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:22,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:22,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:22,549 INFO L87 Difference]: Start difference. First operand 1860 states and 2787 transitions. Second operand 3 states. [2019-12-07 16:57:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:22,667 INFO L93 Difference]: Finished difference Result 4120 states and 6186 transitions. [2019-12-07 16:57:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:22,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-12-07 16:57:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:22,669 INFO L225 Difference]: With dead ends: 4120 [2019-12-07 16:57:22,669 INFO L226 Difference]: Without dead ends: 2279 [2019-12-07 16:57:22,670 INFO L630 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-12-07 16:57:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-12-07 16:57:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2274. [2019-12-07 16:57:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2019-12-07 16:57:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3414 transitions. [2019-12-07 16:57:22,742 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3414 transitions. Word has length 169 [2019-12-07 16:57:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:22,742 INFO L462 AbstractCegarLoop]: Abstraction has 2274 states and 3414 transitions. [2019-12-07 16:57:22,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3414 transitions. [2019-12-07 16:57:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 16:57:22,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:22,743 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:22,744 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1269802298, now seen corresponding path program 1 times [2019-12-07 16:57:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:22,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968323082] [2019-12-07 16:57:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 16:57:22,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968323082] [2019-12-07 16:57:22,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:22,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:22,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986625210] [2019-12-07 16:57:22,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:22,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:22,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:22,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:22,774 INFO L87 Difference]: Start difference. First operand 2274 states and 3414 transitions. Second operand 3 states. [2019-12-07 16:57:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:22,876 INFO L93 Difference]: Finished difference Result 4556 states and 6843 transitions. [2019-12-07 16:57:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:22,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-12-07 16:57:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:22,878 INFO L225 Difference]: With dead ends: 4556 [2019-12-07 16:57:22,878 INFO L226 Difference]: Without dead ends: 2301 [2019-12-07 16:57:22,879 INFO L630 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-12-07 16:57:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2019-12-07 16:57:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2019-12-07 16:57:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2301 states. [2019-12-07 16:57:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3449 transitions. [2019-12-07 16:57:22,952 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3449 transitions. Word has length 169 [2019-12-07 16:57:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:22,952 INFO L462 AbstractCegarLoop]: Abstraction has 2301 states and 3449 transitions. [2019-12-07 16:57:22,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3449 transitions. [2019-12-07 16:57:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 16:57:22,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:22,953 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 16:57:22,953 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash 346634872, now seen corresponding path program 1 times [2019-12-07 16:57:22,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:22,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390291193] [2019-12-07 16:57:22,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 16:57:22,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390291193] [2019-12-07 16:57:22,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:22,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:22,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192491504] [2019-12-07 16:57:22,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:22,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:22,982 INFO L87 Difference]: Start difference. First operand 2301 states and 3449 transitions. Second operand 3 states. [2019-12-07 16:57:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:23,059 INFO L93 Difference]: Finished difference Result 4127 states and 6190 transitions. [2019-12-07 16:57:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:23,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-12-07 16:57:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:23,061 INFO L225 Difference]: With dead ends: 4127 [2019-12-07 16:57:23,061 INFO L226 Difference]: Without dead ends: 1845 [2019-12-07 16:57:23,062 INFO L630 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-12-07 16:57:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2019-12-07 16:57:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1845. [2019-12-07 16:57:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-12-07 16:57:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2762 transitions. [2019-12-07 16:57:23,122 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2762 transitions. Word has length 169 [2019-12-07 16:57:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:23,122 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2762 transitions. [2019-12-07 16:57:23,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2762 transitions. [2019-12-07 16:57:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 16:57:23,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:23,123 INFO L410 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] [2019-12-07 16:57:23,123 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash 902037120, now seen corresponding path program 1 times [2019-12-07 16:57:23,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:23,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883062665] [2019-12-07 16:57:23,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883062665] [2019-12-07 16:57:23,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979299120] [2019-12-07 16:57:23,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:23,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:23,163 INFO L87 Difference]: Start difference. First operand 1845 states and 2762 transitions. Second operand 4 states. [2019-12-07 16:57:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:23,503 INFO L93 Difference]: Finished difference Result 3814 states and 5687 transitions. [2019-12-07 16:57:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:23,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-12-07 16:57:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:23,505 INFO L225 Difference]: With dead ends: 3814 [2019-12-07 16:57:23,505 INFO L226 Difference]: Without dead ends: 1990 [2019-12-07 16:57:23,506 INFO L630 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-12-07 16:57:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-12-07 16:57:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1845. [2019-12-07 16:57:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-12-07 16:57:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2758 transitions. [2019-12-07 16:57:23,568 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2758 transitions. Word has length 171 [2019-12-07 16:57:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:23,568 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2758 transitions. [2019-12-07 16:57:23,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2758 transitions. [2019-12-07 16:57:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 16:57:23,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:23,569 INFO L410 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] [2019-12-07 16:57:23,569 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash 556313983, now seen corresponding path program 1 times [2019-12-07 16:57:23,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:23,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770777736] [2019-12-07 16:57:23,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:23,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770777736] [2019-12-07 16:57:23,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:23,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:23,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541525709] [2019-12-07 16:57:23,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:23,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:23,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:23,610 INFO L87 Difference]: Start difference. First operand 1845 states and 2758 transitions. Second operand 4 states. [2019-12-07 16:57:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:23,956 INFO L93 Difference]: Finished difference Result 3814 states and 5679 transitions. [2019-12-07 16:57:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:23,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 16:57:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:23,959 INFO L225 Difference]: With dead ends: 3814 [2019-12-07 16:57:23,959 INFO L226 Difference]: Without dead ends: 1990 [2019-12-07 16:57:23,960 INFO L630 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-12-07 16:57:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-12-07 16:57:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1845. [2019-12-07 16:57:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-12-07 16:57:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2754 transitions. [2019-12-07 16:57:24,022 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2754 transitions. Word has length 172 [2019-12-07 16:57:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:24,022 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2754 transitions. [2019-12-07 16:57:24,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2754 transitions. [2019-12-07 16:57:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 16:57:24,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:24,023 INFO L410 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] [2019-12-07 16:57:24,023 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash -306405979, now seen corresponding path program 1 times [2019-12-07 16:57:24,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:24,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710316954] [2019-12-07 16:57:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710316954] [2019-12-07 16:57:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502198006] [2019-12-07 16:57:24,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:24,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:24,067 INFO L87 Difference]: Start difference. First operand 1845 states and 2754 transitions. Second operand 4 states. [2019-12-07 16:57:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:24,453 INFO L93 Difference]: Finished difference Result 3814 states and 5671 transitions. [2019-12-07 16:57:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:24,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 16:57:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:24,455 INFO L225 Difference]: With dead ends: 3814 [2019-12-07 16:57:24,455 INFO L226 Difference]: Without dead ends: 1990 [2019-12-07 16:57:24,456 INFO L630 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-12-07 16:57:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-12-07 16:57:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1845. [2019-12-07 16:57:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-12-07 16:57:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2750 transitions. [2019-12-07 16:57:24,518 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2750 transitions. Word has length 173 [2019-12-07 16:57:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:24,518 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2750 transitions. [2019-12-07 16:57:24,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2750 transitions. [2019-12-07 16:57:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 16:57:24,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:24,519 INFO L410 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] [2019-12-07 16:57:24,519 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -16158332, now seen corresponding path program 1 times [2019-12-07 16:57:24,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:24,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222361005] [2019-12-07 16:57:24,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:24,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222361005] [2019-12-07 16:57:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:24,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455625] [2019-12-07 16:57:24,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:24,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:24,581 INFO L87 Difference]: Start difference. First operand 1845 states and 2750 transitions. Second operand 4 states. [2019-12-07 16:57:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:24,908 INFO L93 Difference]: Finished difference Result 3774 states and 5615 transitions. [2019-12-07 16:57:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:24,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-12-07 16:57:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:24,910 INFO L225 Difference]: With dead ends: 3774 [2019-12-07 16:57:24,910 INFO L226 Difference]: Without dead ends: 1950 [2019-12-07 16:57:24,911 INFO L630 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-12-07 16:57:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-12-07 16:57:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1845. [2019-12-07 16:57:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-12-07 16:57:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2746 transitions. [2019-12-07 16:57:24,974 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2746 transitions. Word has length 174 [2019-12-07 16:57:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:24,974 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2746 transitions. [2019-12-07 16:57:24,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2746 transitions. [2019-12-07 16:57:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 16:57:24,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:24,975 INFO L410 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] [2019-12-07 16:57:24,975 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 908916130, now seen corresponding path program 1 times [2019-12-07 16:57:24,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:24,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496892743] [2019-12-07 16:57:24,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 16:57:25,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496892743] [2019-12-07 16:57:25,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:25,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:57:25,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114337093] [2019-12-07 16:57:25,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:25,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:25,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:25,048 INFO L87 Difference]: Start difference. First operand 1845 states and 2746 transitions. Second operand 5 states. [2019-12-07 16:57:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:25,473 INFO L93 Difference]: Finished difference Result 4118 states and 6148 transitions. [2019-12-07 16:57:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:25,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-12-07 16:57:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:25,474 INFO L225 Difference]: With dead ends: 4118 [2019-12-07 16:57:25,475 INFO L226 Difference]: Without dead ends: 2294 [2019-12-07 16:57:25,475 INFO L630 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-12-07 16:57:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-12-07 16:57:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2004. [2019-12-07 16:57:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2019-12-07 16:57:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 3033 transitions. [2019-12-07 16:57:25,541 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 3033 transitions. Word has length 176 [2019-12-07 16:57:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:25,541 INFO L462 AbstractCegarLoop]: Abstraction has 2004 states and 3033 transitions. [2019-12-07 16:57:25,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 3033 transitions. [2019-12-07 16:57:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 16:57:25,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:25,542 INFO L410 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] [2019-12-07 16:57:25,542 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2090779804, now seen corresponding path program 1 times [2019-12-07 16:57:25,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:25,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874956670] [2019-12-07 16:57:25,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 16:57:25,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874956670] [2019-12-07 16:57:25,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:25,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:57:25,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255974419] [2019-12-07 16:57:25,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:25,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:25,618 INFO L87 Difference]: Start difference. First operand 2004 states and 3033 transitions. Second operand 5 states. [2019-12-07 16:57:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:26,456 INFO L93 Difference]: Finished difference Result 4389 states and 6655 transitions. [2019-12-07 16:57:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:26,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-12-07 16:57:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:26,459 INFO L225 Difference]: With dead ends: 4389 [2019-12-07 16:57:26,459 INFO L226 Difference]: Without dead ends: 2406 [2019-12-07 16:57:26,460 INFO L630 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-12-07 16:57:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2019-12-07 16:57:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2114. [2019-12-07 16:57:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-07 16:57:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3255 transitions. [2019-12-07 16:57:26,527 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3255 transitions. Word has length 177 [2019-12-07 16:57:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:26,528 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 3255 transitions. [2019-12-07 16:57:26,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3255 transitions. [2019-12-07 16:57:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 16:57:26,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:26,529 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-12-07 16:57:26,529 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1531587811, now seen corresponding path program 1 times [2019-12-07 16:57:26,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:26,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820762476] [2019-12-07 16:57:26,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820762476] [2019-12-07 16:57:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815636907] [2019-12-07 16:57:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/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-12-07 16:57:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:26,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 16:57:26,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:26,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:26,989 INFO L377 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-12-07 16:57:26,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,018 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 16:57:27,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,048 INFO L377 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-12-07 16:57:27,048 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,079 INFO L377 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-12-07 16:57:27,080 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,114 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:27,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 16:57:27,115 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,124 INFO L534 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-12-07 16:57:27,124 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 16:57:27,157 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:27,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:27,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:27,195 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:27,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:27,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,201 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:27,204 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 16:57:27,207 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,255 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 16:57:27,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 16:57:27,255 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,262 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 16:57:27,287 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:27,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:27,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:27,313 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:27,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:27,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,320 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:27,325 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 16:57:27,326 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,368 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 16:57:27,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 16:57:27,369 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,376 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 16:57:27,381 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 16:57:27,384 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:27,385 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,463 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 16:57:27,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 16:57:27,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,483 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 16:57:27,550 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 16:57:27,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 16:57:27,553 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 16:57:27,554 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,565 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,598 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 16:57:27,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 16:57:27,599 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,606 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 16:57:27,610 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-12-07 16:57:27,613 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:27,613 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,690 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 16:57:27,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 16:57:27,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:27,693 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,717 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 16:57:27,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,717 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 16:57:27,720 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-12-07 16:57:27,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 16:57:27,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,783 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 16:57:27,783 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,824 INFO L377 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 90 treesize of output 62 [2019-12-07 16:57:27,825 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,854 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,880 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:27,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-12-07 16:57:27,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 137 treesize of output 119 [2019-12-07 16:57:27,919 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:27,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:27,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:27,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:28,019 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 16:57:28,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-12-07 16:57:28,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:28,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:28,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:28,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:28,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:28,022 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:28,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:28,033 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:28,047 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:28,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:28,047 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 16:57:28,072 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-12-07 16:57:28,074 INFO L377 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 53 treesize of output 41 [2019-12-07 16:57:28,075 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:28,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:28,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:28,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:28,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:28,092 INFO L377 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 93 treesize of output 45 [2019-12-07 16:57:28,093 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:28,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:28,107 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 16:57:28,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 16:57:28,108 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:28,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:28,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:28,114 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-12-07 16:57:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 16:57:28,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:57:28,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 16:57:28,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937213646] [2019-12-07 16:57:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:57:28,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:57:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:57:28,394 INFO L87 Difference]: Start difference. First operand 2114 states and 3255 transitions. Second operand 10 states. [2019-12-07 16:57:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:31,201 INFO L93 Difference]: Finished difference Result 9050 states and 13827 transitions. [2019-12-07 16:57:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:57:31,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2019-12-07 16:57:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:31,211 INFO L225 Difference]: With dead ends: 9050 [2019-12-07 16:57:31,211 INFO L226 Difference]: Without dead ends: 6957 [2019-12-07 16:57:31,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:57:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-12-07 16:57:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 4642. [2019-12-07 16:57:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-12-07 16:57:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 7290 transitions. [2019-12-07 16:57:31,484 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 7290 transitions. Word has length 190 [2019-12-07 16:57:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:31,485 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 7290 transitions. [2019-12-07 16:57:31,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:57:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 7290 transitions. [2019-12-07 16:57:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 16:57:31,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:31,490 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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] [2019-12-07 16:57:31,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:31,691 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1579350021, now seen corresponding path program 1 times [2019-12-07 16:57:31,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:31,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580932306] [2019-12-07 16:57:31,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 16:57:31,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580932306] [2019-12-07 16:57:31,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:31,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:31,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267828844] [2019-12-07 16:57:31,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:31,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:31,769 INFO L87 Difference]: Start difference. First operand 4642 states and 7290 transitions. Second operand 4 states. [2019-12-07 16:57:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:32,284 INFO L93 Difference]: Finished difference Result 9473 states and 14834 transitions. [2019-12-07 16:57:32,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:32,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-12-07 16:57:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:32,289 INFO L225 Difference]: With dead ends: 9473 [2019-12-07 16:57:32,289 INFO L226 Difference]: Without dead ends: 4852 [2019-12-07 16:57:32,291 INFO L630 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-12-07 16:57:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2019-12-07 16:57:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 4642. [2019-12-07 16:57:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-12-07 16:57:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 7282 transitions. [2019-12-07 16:57:32,467 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 7282 transitions. Word has length 198 [2019-12-07 16:57:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:32,467 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 7282 transitions. [2019-12-07 16:57:32,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 7282 transitions. [2019-12-07 16:57:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 16:57:32,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:32,469 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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] [2019-12-07 16:57:32,469 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1650806886, now seen corresponding path program 1 times [2019-12-07 16:57:32,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:32,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005923556] [2019-12-07 16:57:32,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 16:57:32,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005923556] [2019-12-07 16:57:32,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:32,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:32,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932531770] [2019-12-07 16:57:32,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:32,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:32,526 INFO L87 Difference]: Start difference. First operand 4642 states and 7282 transitions. Second operand 4 states. [2019-12-07 16:57:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:32,988 INFO L93 Difference]: Finished difference Result 9457 states and 14802 transitions. [2019-12-07 16:57:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:32,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-12-07 16:57:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:32,991 INFO L225 Difference]: With dead ends: 9457 [2019-12-07 16:57:32,991 INFO L226 Difference]: Without dead ends: 4836 [2019-12-07 16:57:32,993 INFO L630 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-12-07 16:57:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2019-12-07 16:57:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4642. [2019-12-07 16:57:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-12-07 16:57:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 7274 transitions. [2019-12-07 16:57:33,160 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 7274 transitions. Word has length 199 [2019-12-07 16:57:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:33,160 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 7274 transitions. [2019-12-07 16:57:33,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 7274 transitions. [2019-12-07 16:57:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 16:57:33,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:33,162 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1] [2019-12-07 16:57:33,162 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 110795683, now seen corresponding path program 1 times [2019-12-07 16:57:33,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:33,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592802814] [2019-12-07 16:57:33,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-12-07 16:57:33,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592802814] [2019-12-07 16:57:33,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:33,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:57:33,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963875717] [2019-12-07 16:57:33,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:57:33,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:57:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:57:33,252 INFO L87 Difference]: Start difference. First operand 4642 states and 7274 transitions. Second operand 6 states. [2019-12-07 16:57:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:34,232 INFO L93 Difference]: Finished difference Result 10662 states and 16672 transitions. [2019-12-07 16:57:34,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:34,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-12-07 16:57:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:34,237 INFO L225 Difference]: With dead ends: 10662 [2019-12-07 16:57:34,237 INFO L226 Difference]: Without dead ends: 6041 [2019-12-07 16:57:34,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2019-12-07 16:57:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 4710. [2019-12-07 16:57:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4710 states. [2019-12-07 16:57:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 7378 transitions. [2019-12-07 16:57:34,401 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 7378 transitions. Word has length 203 [2019-12-07 16:57:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:34,401 INFO L462 AbstractCegarLoop]: Abstraction has 4710 states and 7378 transitions. [2019-12-07 16:57:34,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:57:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 7378 transitions. [2019-12-07 16:57:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-12-07 16:57:34,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:34,404 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1] [2019-12-07 16:57:34,404 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash -924704632, now seen corresponding path program 1 times [2019-12-07 16:57:34,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:34,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258902395] [2019-12-07 16:57:34,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-12-07 16:57:34,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258902395] [2019-12-07 16:57:34,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:34,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:57:34,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043159731] [2019-12-07 16:57:34,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:57:34,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:34,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:57:34,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:57:34,509 INFO L87 Difference]: Start difference. First operand 4710 states and 7378 transitions. Second operand 6 states. [2019-12-07 16:57:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:35,587 INFO L93 Difference]: Finished difference Result 10362 states and 16108 transitions. [2019-12-07 16:57:35,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:35,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-12-07 16:57:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:35,591 INFO L225 Difference]: With dead ends: 10362 [2019-12-07 16:57:35,591 INFO L226 Difference]: Without dead ends: 5673 [2019-12-07 16:57:35,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-12-07 16:57:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 4714. [2019-12-07 16:57:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-12-07 16:57:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7366 transitions. [2019-12-07 16:57:35,755 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7366 transitions. Word has length 204 [2019-12-07 16:57:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:35,755 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7366 transitions. [2019-12-07 16:57:35,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:57:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7366 transitions. [2019-12-07 16:57:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 16:57:35,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:35,757 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:35,757 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 355407375, now seen corresponding path program 1 times [2019-12-07 16:57:35,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:35,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405612351] [2019-12-07 16:57:35,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 16:57:35,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405612351] [2019-12-07 16:57:35,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:35,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:35,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334040786] [2019-12-07 16:57:35,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:35,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:35,858 INFO L87 Difference]: Start difference. First operand 4714 states and 7366 transitions. Second operand 4 states. [2019-12-07 16:57:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:36,380 INFO L93 Difference]: Finished difference Result 7365 states and 11435 transitions. [2019-12-07 16:57:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:36,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-12-07 16:57:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:36,384 INFO L225 Difference]: With dead ends: 7365 [2019-12-07 16:57:36,384 INFO L226 Difference]: Without dead ends: 5080 [2019-12-07 16:57:36,385 INFO L630 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-12-07 16:57:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2019-12-07 16:57:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 4714. [2019-12-07 16:57:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-12-07 16:57:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7346 transitions. [2019-12-07 16:57:36,543 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7346 transitions. Word has length 210 [2019-12-07 16:57:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:36,544 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7346 transitions. [2019-12-07 16:57:36,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7346 transitions. [2019-12-07 16:57:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-07 16:57:36,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:36,546 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:36,546 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:36,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1845773238, now seen corresponding path program 1 times [2019-12-07 16:57:36,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:36,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235826286] [2019-12-07 16:57:36,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 16:57:36,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235826286] [2019-12-07 16:57:36,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:36,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:36,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215152789] [2019-12-07 16:57:36,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:36,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:36,624 INFO L87 Difference]: Start difference. First operand 4714 states and 7346 transitions. Second operand 4 states. [2019-12-07 16:57:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:37,135 INFO L93 Difference]: Finished difference Result 7365 states and 11407 transitions. [2019-12-07 16:57:37,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:37,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-12-07 16:57:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:37,139 INFO L225 Difference]: With dead ends: 7365 [2019-12-07 16:57:37,139 INFO L226 Difference]: Without dead ends: 5080 [2019-12-07 16:57:37,140 INFO L630 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-12-07 16:57:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2019-12-07 16:57:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 4714. [2019-12-07 16:57:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-12-07 16:57:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7326 transitions. [2019-12-07 16:57:37,297 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7326 transitions. Word has length 211 [2019-12-07 16:57:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:37,297 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7326 transitions. [2019-12-07 16:57:37,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7326 transitions. [2019-12-07 16:57:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 16:57:37,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:37,300 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:37,300 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 287476596, now seen corresponding path program 1 times [2019-12-07 16:57:37,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:37,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888510687] [2019-12-07 16:57:37,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 16:57:37,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888510687] [2019-12-07 16:57:37,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:37,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:37,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746018530] [2019-12-07 16:57:37,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:37,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:37,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:37,388 INFO L87 Difference]: Start difference. First operand 4714 states and 7326 transitions. Second operand 4 states. [2019-12-07 16:57:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:37,920 INFO L93 Difference]: Finished difference Result 7365 states and 11379 transitions. [2019-12-07 16:57:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:37,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-12-07 16:57:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:37,924 INFO L225 Difference]: With dead ends: 7365 [2019-12-07 16:57:37,925 INFO L226 Difference]: Without dead ends: 5080 [2019-12-07 16:57:37,926 INFO L630 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-12-07 16:57:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2019-12-07 16:57:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 4714. [2019-12-07 16:57:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-12-07 16:57:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7306 transitions. [2019-12-07 16:57:38,086 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7306 transitions. Word has length 212 [2019-12-07 16:57:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:38,086 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7306 transitions. [2019-12-07 16:57:38,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7306 transitions. [2019-12-07 16:57:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 16:57:38,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:38,089 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:38,089 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash -650883185, now seen corresponding path program 1 times [2019-12-07 16:57:38,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:38,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357314821] [2019-12-07 16:57:38,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 16:57:38,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357314821] [2019-12-07 16:57:38,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:38,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:38,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987935687] [2019-12-07 16:57:38,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:38,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:38,167 INFO L87 Difference]: Start difference. First operand 4714 states and 7306 transitions. Second operand 4 states. [2019-12-07 16:57:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:38,663 INFO L93 Difference]: Finished difference Result 7325 states and 11303 transitions. [2019-12-07 16:57:38,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:38,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-12-07 16:57:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:38,667 INFO L225 Difference]: With dead ends: 7325 [2019-12-07 16:57:38,667 INFO L226 Difference]: Without dead ends: 5040 [2019-12-07 16:57:38,668 INFO L630 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-12-07 16:57:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2019-12-07 16:57:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4714. [2019-12-07 16:57:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-12-07 16:57:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7286 transitions. [2019-12-07 16:57:38,828 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7286 transitions. Word has length 213 [2019-12-07 16:57:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:38,828 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7286 transitions. [2019-12-07 16:57:38,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7286 transitions. [2019-12-07 16:57:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-07 16:57:38,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:38,830 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:38,830 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:38,830 INFO L82 PathProgramCache]: Analyzing trace with hash -586530833, now seen corresponding path program 1 times [2019-12-07 16:57:38,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:38,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308797476] [2019-12-07 16:57:38,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-12-07 16:57:38,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308797476] [2019-12-07 16:57:38,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:38,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:38,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783836343] [2019-12-07 16:57:38,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:38,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:38,907 INFO L87 Difference]: Start difference. First operand 4714 states and 7286 transitions. Second operand 4 states. [2019-12-07 16:57:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:39,305 INFO L93 Difference]: Finished difference Result 9665 states and 14936 transitions. [2019-12-07 16:57:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:39,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-12-07 16:57:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:39,308 INFO L225 Difference]: With dead ends: 9665 [2019-12-07 16:57:39,309 INFO L226 Difference]: Without dead ends: 4972 [2019-12-07 16:57:39,310 INFO L630 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-12-07 16:57:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-12-07 16:57:39,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4882. [2019-12-07 16:57:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4882 states. [2019-12-07 16:57:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 7566 transitions. [2019-12-07 16:57:39,470 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 7566 transitions. Word has length 226 [2019-12-07 16:57:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:39,471 INFO L462 AbstractCegarLoop]: Abstraction has 4882 states and 7566 transitions. [2019-12-07 16:57:39,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 7566 transitions. [2019-12-07 16:57:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-12-07 16:57:39,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:39,473 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:39,473 INFO L410 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:39,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2037746483, now seen corresponding path program 1 times [2019-12-07 16:57:39,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:39,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165294586] [2019-12-07 16:57:39,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-12-07 16:57:39,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165294586] [2019-12-07 16:57:39,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:39,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:39,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929387677] [2019-12-07 16:57:39,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:39,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:39,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:39,560 INFO L87 Difference]: Start difference. First operand 4882 states and 7566 transitions. Second operand 4 states. [2019-12-07 16:57:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:40,095 INFO L93 Difference]: Finished difference Result 10321 states and 15994 transitions. [2019-12-07 16:57:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:40,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-12-07 16:57:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:40,100 INFO L225 Difference]: With dead ends: 10321 [2019-12-07 16:57:40,100 INFO L226 Difference]: Without dead ends: 5460 [2019-12-07 16:57:40,102 INFO L630 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-12-07 16:57:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2019-12-07 16:57:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 5162. [2019-12-07 16:57:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5162 states. [2019-12-07 16:57:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 8062 transitions. [2019-12-07 16:57:40,269 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 8062 transitions. Word has length 227 [2019-12-07 16:57:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:40,269 INFO L462 AbstractCegarLoop]: Abstraction has 5162 states and 8062 transitions. [2019-12-07 16:57:40,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 8062 transitions. [2019-12-07 16:57:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 16:57:40,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:40,271 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:40,271 INFO L410 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1520351000, now seen corresponding path program 2 times [2019-12-07 16:57:40,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:40,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397145895] [2019-12-07 16:57:40,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 260 proven. 154 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 16:57:40,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397145895] [2019-12-07 16:57:40,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197323799] [2019-12-07 16:57:40,539 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:40,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:57:40,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:57:40,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 16:57:40,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:40,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,746 INFO L377 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-12-07 16:57:40,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,768 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_186|], 2=[|v_#memory_$Pointer$.base_178|, |v_#memory_$Pointer$.base_177|]} [2019-12-07 16:57:40,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,786 INFO L377 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 28 treesize of output 22 [2019-12-07 16:57:40,786 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,811 INFO L377 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 41 treesize of output 31 [2019-12-07 16:57:40,812 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,829 INFO L377 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 41 treesize of output 31 [2019-12-07 16:57:40,830 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,839 INFO L534 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-12-07 16:57:40,839 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:92, output treesize:44 [2019-12-07 16:57:40,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,854 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:40,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,862 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,862 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 16:57:40,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,870 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:40,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 16:57:40,880 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_179|], 6=[|v_#memory_$Pointer$.base_189|]} [2019-12-07 16:57:40,883 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:40,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,900 INFO L377 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 65 treesize of output 47 [2019-12-07 16:57:40,900 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,909 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2019-12-07 16:57:40,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,917 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:40,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 16:57:40,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,933 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,933 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:40,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 16:57:40,945 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_180|], 6=[|v_#memory_$Pointer$.base_192|]} [2019-12-07 16:57:40,946 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:40,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,966 INFO L377 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 65 treesize of output 47 [2019-12-07 16:57:40,966 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2019-12-07 16:57:40,980 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_166|], 14=[|v_#memory_$Pointer$.base_193|]} [2019-12-07 16:57:40,982 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:40,982 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:40,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:40,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:57:41,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,047 INFO L377 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 210 [2019-12-07 16:57:41,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,057 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 16:57:41,099 INFO L614 ElimStorePlain]: treesize reduction 1442, result has 3.0 percent of original size [2019-12-07 16:57:41,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,100 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:44 [2019-12-07 16:57:41,101 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_181|], 6=[|v_#memory_$Pointer$.base_194|]} [2019-12-07 16:57:41,103 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,119 INFO L377 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 65 treesize of output 47 [2019-12-07 16:57:41,119 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,127 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2019-12-07 16:57:41,130 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_167|], 14=[|v_#memory_$Pointer$.base_195|]} [2019-12-07 16:57:41,132 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:41,132 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:57:41,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,191 INFO L377 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 210 [2019-12-07 16:57:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,200 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 16:57:41,243 INFO L614 ElimStorePlain]: treesize reduction 1375, result has 3.4 percent of original size [2019-12-07 16:57:41,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,244 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:48 [2019-12-07 16:57:41,251 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 2=[|v_#memory_$Pointer$.base_182|], 6=[|v_#memory_$Pointer$.base_196|, |v_#memory_$Pointer$.base_183|]} [2019-12-07 16:57:41,254 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:41,254 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,275 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,301 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:41,301 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:57:41,420 INFO L343 Elim1Store]: treesize reduction 50, result has 75.1 percent of original size [2019-12-07 16:57:41,420 INFO L377 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 5 new quantified variables, introduced 11 case distinctions, treesize of input 104 treesize of output 170 [2019-12-07 16:57:41,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,425 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2019-12-07 16:57:41,493 INFO L614 ElimStorePlain]: treesize reduction 519, result has 10.8 percent of original size [2019-12-07 16:57:41,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,493 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:48 [2019-12-07 16:57:41,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,509 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:41,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,516 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 16:57:41,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,523 INFO L377 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 60 treesize of output 38 [2019-12-07 16:57:41,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 16:57:41,532 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_180|], 2=[|v_#memory_$Pointer$.offset_168|, |v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.offset_165|, |v_#memory_$Pointer$.base_185|, |v_#memory_$Pointer$.base_184|], 14=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 16:57:41,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 40 [2019-12-07 16:57:41,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,645 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 16:57:41,645 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,712 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,770 INFO L377 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 95 treesize of output 71 [2019-12-07 16:57:41,770 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:41,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,802 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,832 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:41,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:41,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:57:41,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:41,968 INFO L343 Elim1Store]: treesize reduction 85, result has 70.8 percent of original size [2019-12-07 16:57:41,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 142 treesize of output 249 [2019-12-07 16:57:41,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:41,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:41,972 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,067 INFO L614 ElimStorePlain]: treesize reduction 699, result has 15.3 percent of original size [2019-12-07 16:57:42,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,068 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:292, output treesize:87 [2019-12-07 16:57:42,092 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_169|], 10=[|v_#memory_$Pointer$.base_200|], 12=[|v_#memory_int_181|]} [2019-12-07 16:57:42,095 INFO L377 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 53 treesize of output 41 [2019-12-07 16:57:42,096 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:42,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,120 INFO L377 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 104 treesize of output 68 [2019-12-07 16:57:42,121 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 43 [2019-12-07 16:57:42,140 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:42,151 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:137, output treesize:87 [2019-12-07 16:57:42,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:42,179 INFO L377 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 66 treesize of output 32 [2019-12-07 16:57:42,180 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:42,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:42,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:41 [2019-12-07 16:57:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 194 proven. 93 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-12-07 16:57:42,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:57:42,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-12-07 16:57:42,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646883386] [2019-12-07 16:57:42,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:57:42,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:57:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:57:42,529 INFO L87 Difference]: Start difference. First operand 5162 states and 8062 transitions. Second operand 11 states. [2019-12-07 16:57:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:45,618 INFO L93 Difference]: Finished difference Result 12667 states and 19551 transitions. [2019-12-07 16:57:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:57:45,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-12-07 16:57:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:45,624 INFO L225 Difference]: With dead ends: 12667 [2019-12-07 16:57:45,624 INFO L226 Difference]: Without dead ends: 7526 [2019-12-07 16:57:45,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:57:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7526 states. [2019-12-07 16:57:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7526 to 5203. [2019-12-07 16:57:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5203 states. [2019-12-07 16:57:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 8115 transitions. [2019-12-07 16:57:45,811 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 8115 transitions. Word has length 232 [2019-12-07 16:57:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:45,812 INFO L462 AbstractCegarLoop]: Abstraction has 5203 states and 8115 transitions. [2019-12-07 16:57:45,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:57:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 8115 transitions. [2019-12-07 16:57:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-07 16:57:45,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:45,814 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-12-07 16:57:46,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:46,016 INFO L410 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1526454934, now seen corresponding path program 1 times [2019-12-07 16:57:46,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:46,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963614254] [2019-12-07 16:57:46,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-12-07 16:57:46,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963614254] [2019-12-07 16:57:46,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:46,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:46,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621935640] [2019-12-07 16:57:46,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:46,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:46,114 INFO L87 Difference]: Start difference. First operand 5203 states and 8115 transitions. Second operand 4 states. [2019-12-07 16:57:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:46,488 INFO L93 Difference]: Finished difference Result 7824 states and 12178 transitions. [2019-12-07 16:57:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:46,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-12-07 16:57:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:46,493 INFO L225 Difference]: With dead ends: 7824 [2019-12-07 16:57:46,493 INFO L226 Difference]: Without dead ends: 5315 [2019-12-07 16:57:46,494 INFO L630 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-12-07 16:57:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5315 states. [2019-12-07 16:57:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5315 to 5267. [2019-12-07 16:57:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5267 states. [2019-12-07 16:57:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 8215 transitions. [2019-12-07 16:57:46,673 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 8215 transitions. Word has length 238 [2019-12-07 16:57:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:46,673 INFO L462 AbstractCegarLoop]: Abstraction has 5267 states and 8215 transitions. [2019-12-07 16:57:46,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 8215 transitions. [2019-12-07 16:57:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-12-07 16:57:46,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:46,675 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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-12-07 16:57:46,675 INFO L410 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1239230870, now seen corresponding path program 1 times [2019-12-07 16:57:46,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:46,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078869432] [2019-12-07 16:57:46,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-12-07 16:57:46,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078869432] [2019-12-07 16:57:46,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:46,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:57:46,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254061110] [2019-12-07 16:57:46,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:46,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:46,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:46,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:46,756 INFO L87 Difference]: Start difference. First operand 5267 states and 8215 transitions. Second operand 5 states. [2019-12-07 16:57:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:47,208 INFO L93 Difference]: Finished difference Result 7840 states and 12218 transitions. [2019-12-07 16:57:47,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:57:47,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-12-07 16:57:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:47,212 INFO L225 Difference]: With dead ends: 7840 [2019-12-07 16:57:47,212 INFO L226 Difference]: Without dead ends: 5267 [2019-12-07 16:57:47,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:57:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2019-12-07 16:57:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5267. [2019-12-07 16:57:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5267 states. [2019-12-07 16:57:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 8211 transitions. [2019-12-07 16:57:47,388 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 8211 transitions. Word has length 239 [2019-12-07 16:57:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:47,388 INFO L462 AbstractCegarLoop]: Abstraction has 5267 states and 8211 transitions. [2019-12-07 16:57:47,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 8211 transitions. [2019-12-07 16:57:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-12-07 16:57:47,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:47,391 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-12-07 16:57:47,391 INFO L410 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1767055062, now seen corresponding path program 1 times [2019-12-07 16:57:47,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:47,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122647648] [2019-12-07 16:57:47,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-12-07 16:57:47,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122647648] [2019-12-07 16:57:47,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:47,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:57:47,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908849852] [2019-12-07 16:57:47,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:47,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:47,489 INFO L87 Difference]: Start difference. First operand 5267 states and 8211 transitions. Second operand 5 states. [2019-12-07 16:57:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:48,141 INFO L93 Difference]: Finished difference Result 11299 states and 17572 transitions. [2019-12-07 16:57:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:48,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-12-07 16:57:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:48,145 INFO L225 Difference]: With dead ends: 11299 [2019-12-07 16:57:48,145 INFO L226 Difference]: Without dead ends: 6053 [2019-12-07 16:57:48,147 INFO L630 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-12-07 16:57:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2019-12-07 16:57:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 5430. [2019-12-07 16:57:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5430 states. [2019-12-07 16:57:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5430 states to 5430 states and 8494 transitions. [2019-12-07 16:57:48,342 INFO L78 Accepts]: Start accepts. Automaton has 5430 states and 8494 transitions. Word has length 239 [2019-12-07 16:57:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:48,342 INFO L462 AbstractCegarLoop]: Abstraction has 5430 states and 8494 transitions. [2019-12-07 16:57:48,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5430 states and 8494 transitions. [2019-12-07 16:57:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-12-07 16:57:48,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:48,344 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:48,344 INFO L410 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2129951478, now seen corresponding path program 1 times [2019-12-07 16:57:48,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:48,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193931973] [2019-12-07 16:57:48,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-12-07 16:57:48,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193931973] [2019-12-07 16:57:48,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:48,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:57:48,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23352081] [2019-12-07 16:57:48,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:48,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:48,439 INFO L87 Difference]: Start difference. First operand 5430 states and 8494 transitions. Second operand 5 states. [2019-12-07 16:57:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:49,126 INFO L93 Difference]: Finished difference Result 11428 states and 17796 transitions. [2019-12-07 16:57:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:49,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-12-07 16:57:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:49,130 INFO L225 Difference]: With dead ends: 11428 [2019-12-07 16:57:49,131 INFO L226 Difference]: Without dead ends: 6019 [2019-12-07 16:57:49,133 INFO L630 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-12-07 16:57:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2019-12-07 16:57:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 5419. [2019-12-07 16:57:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2019-12-07 16:57:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 8467 transitions. [2019-12-07 16:57:49,316 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 8467 transitions. Word has length 240 [2019-12-07 16:57:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:49,317 INFO L462 AbstractCegarLoop]: Abstraction has 5419 states and 8467 transitions. [2019-12-07 16:57:49,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 8467 transitions. [2019-12-07 16:57:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-12-07 16:57:49,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:49,319 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 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-12-07 16:57:49,319 INFO L410 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1056637038, now seen corresponding path program 1 times [2019-12-07 16:57:49,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:49,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018043802] [2019-12-07 16:57:49,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-12-07 16:57:49,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018043802] [2019-12-07 16:57:49,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887401647] [2019-12-07 16:57:49,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:49,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 16:57:49,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:49,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,758 INFO L377 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-12-07 16:57:49,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,796 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_208|], 2=[|v_#memory_$Pointer$.base_202|, |v_#memory_$Pointer$.base_201|]} [2019-12-07 16:57:49,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,818 INFO L377 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-12-07 16:57:49,819 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:49,845 INFO L377 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-12-07 16:57:49,846 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,894 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:49,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 16:57:49,894 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,902 INFO L534 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-12-07 16:57:49,902 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 16:57:49,936 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:49,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:49,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,942 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,942 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:49,963 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:49,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:49,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:49,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:49,968 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:49,970 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_$Pointer$.base_211|]} [2019-12-07 16:57:49,971 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:49,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,013 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 16:57:50,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 16:57:50,013 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,020 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 16:57:50,043 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:50,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:50,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,048 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,048 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:50,067 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 16:57:50,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 16:57:50,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 16:57:50,076 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_204|], 12=[|v_#memory_$Pointer$.base_214|]} [2019-12-07 16:57:50,077 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,123 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 16:57:50,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 16:57:50,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 16:57:50,133 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_172|], 12=[|v_#memory_$Pointer$.base_215|]} [2019-12-07 16:57:50,135 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:50,135 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,214 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 16:57:50,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 16:57:50,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,216 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,236 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 16:57:50,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 16:57:50,238 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_205|], 12=[|v_#memory_$Pointer$.base_216|]} [2019-12-07 16:57:50,239 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,281 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 16:57:50,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 16:57:50,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,288 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,288 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 16:57:50,292 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_173|], 12=[|v_#memory_$Pointer$.base_217|]} [2019-12-07 16:57:50,294 INFO L377 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 49 treesize of output 37 [2019-12-07 16:57:50,294 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,369 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 16:57:50,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 16:57:50,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:50,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:50,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:50,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,377 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,440 INFO L614 ElimStorePlain]: treesize reduction 1028, result has 4.9 percent of original size [2019-12-07 16:57:50,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,441 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 16:57:50,443 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_170|, |v_#memory_$Pointer$.base_206|, |v_#memory_$Pointer$.offset_171|], 6=[|v_#memory_$Pointer$.base_207|], 12=[|v_#memory_$Pointer$.base_218|]} [2019-12-07 16:57:50,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 16:57:50,454 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,521 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 16:57:50,521 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,565 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,614 INFO L377 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 116 treesize of output 88 [2019-12-07 16:57:50,615 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,643 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-12-07 16:57:50,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 137 treesize of output 119 [2019-12-07 16:57:50,690 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,802 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 16:57:50,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-12-07 16:57:50,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,804 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,834 INFO L614 ElimStorePlain]: treesize reduction 73, result has 58.8 percent of original size [2019-12-07 16:57:50,835 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,850 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 16:57:50,874 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_174|], 6=[|v_#memory_$Pointer$.base_219|], 12=[|v_#memory_int_183|]} [2019-12-07 16:57:50,877 INFO L377 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 53 treesize of output 41 [2019-12-07 16:57:50,877 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:50,900 INFO L377 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 93 treesize of output 45 [2019-12-07 16:57:50,901 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,920 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 16:57:50,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 16:57:50,920 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,928 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-12-07 16:57:50,952 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 16:57:50,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 16:57:50,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,956 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,956 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:50,956 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 16:57:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-12-07 16:57:51,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:57:51,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-12-07 16:57:51,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674131035] [2019-12-07 16:57:51,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:57:51,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:57:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:57:51,205 INFO L87 Difference]: Start difference. First operand 5419 states and 8467 transitions. Second operand 9 states. [2019-12-07 16:57:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:53,731 INFO L93 Difference]: Finished difference Result 10361 states and 15970 transitions. [2019-12-07 16:57:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:57:53,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2019-12-07 16:57:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:53,735 INFO L225 Difference]: With dead ends: 10361 [2019-12-07 16:57:53,735 INFO L226 Difference]: Without dead ends: 7646 [2019-12-07 16:57:53,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:57:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7646 states. [2019-12-07 16:57:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7646 to 5419. [2019-12-07 16:57:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2019-12-07 16:57:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 8463 transitions. [2019-12-07 16:57:53,923 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 8463 transitions. Word has length 246 [2019-12-07 16:57:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:53,923 INFO L462 AbstractCegarLoop]: Abstraction has 5419 states and 8463 transitions. [2019-12-07 16:57:53,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:57:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 8463 transitions. [2019-12-07 16:57:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-12-07 16:57:53,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:53,926 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 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-12-07 16:57:54,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:54,127 INFO L410 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1948896510, now seen corresponding path program 1 times [2019-12-07 16:57:54,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:57:54,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287031854] [2019-12-07 16:57:54,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 336 proven. 52 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 16:57:54,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287031854] [2019-12-07 16:57:54,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478552048] [2019-12-07 16:57:54,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:54,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:57:54,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:54,389 INFO L377 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 20 treesize of output 8 [2019-12-07 16:57:54,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 16:57:54,404 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_220|, |v_#memory_$Pointer$.offset_175|], 5=[|v_#memory_int_184|]} [2019-12-07 16:57:54,406 INFO L377 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 81 treesize of output 63 [2019-12-07 16:57:54,406 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:54,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,410 INFO L377 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 63 treesize of output 51 [2019-12-07 16:57:54,411 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:54,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-12-07 16:57:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,462 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@129a08fc [2019-12-07 16:57:54,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:57:54,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-12-07 16:57:54,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525737615] [2019-12-07 16:57:54,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:57:54,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:57:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:57:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:54,463 INFO L87 Difference]: Start difference. First operand 5419 states and 8463 transitions. Second operand 6 states. [2019-12-07 16:57:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 16:57:54,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:54,665 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@129a08fc at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 16:57:54,674 INFO L168 Benchmark]: Toolchain (without parser) took 68477.74 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 895.0 MB). Free memory was 938.1 MB in the beginning and 1.4 GB in the end (delta: -495.8 MB). Peak memory consumption was 399.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:54,675 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:57:54,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:54,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:54,677 INFO L168 Benchmark]: Boogie Preprocessor took 54.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:54,678 INFO L168 Benchmark]: RCFGBuilder took 659.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.2 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:54,679 INFO L168 Benchmark]: TraceAbstraction took 67300.19 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 792.2 MB). Free memory was 959.2 MB in the beginning and 1.4 GB in the end (delta: -474.7 MB). Peak memory consumption was 317.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:54,684 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 659.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.2 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67300.19 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 792.2 MB). Free memory was 959.2 MB in the beginning and 1.4 GB in the end (delta: -474.7 MB). Peak memory consumption was 317.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@129a08fc de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@129a08fc: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:57:56,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:57:56,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:57:56,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:57:56,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:57:56,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:57:56,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:57:56,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:57:56,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:57:56,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:57:56,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:57:56,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:57:56,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:57:56,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:57:56,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:57:56,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:57:56,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:57:56,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:57:56,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:57:56,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:57:56,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:57:56,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:57:56,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:57:56,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:57:56,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:57:56,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:57:56,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:57:56,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:57:56,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:57:56,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:57:56,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:57:56,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:57:56,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:57:56,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:57:56,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:57:56,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:57:56,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:57:56,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:57:56,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:57:56,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:57:56,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:57:56,130 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 16:57:56,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:57:56,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:57:56,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:57:56,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:57:56,141 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:57:56,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:57:56,142 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:57:56,143 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:57:56,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:57:56,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:57:56,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:57:56,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:57:56,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:57:56,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:57:56,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 16:57:56,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:57:56,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:57:56,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:57:56,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:57:56,145 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_a24fce05-251f-40f5-8267-d8a2f790c2d0/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 -> 6a273cfe729196c7d9dff43b10278ed3e2486c88 [2019-12-07 16:57:56,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:57:56,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:57:56,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:57:56,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:57:56,322 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:57:56,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-12-07 16:57:56,360 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/a80ac8015/5d14860e79e54bee8c5aae9282fe1cb7/FLAG36a133d7c [2019-12-07 16:57:56,787 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:57:56,788 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-12-07 16:57:56,804 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/a80ac8015/5d14860e79e54bee8c5aae9282fe1cb7/FLAG36a133d7c [2019-12-07 16:57:56,815 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/data/a80ac8015/5d14860e79e54bee8c5aae9282fe1cb7 [2019-12-07 16:57:56,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:57:56,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:57:56,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:56,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:57:56,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:57:56,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:56" (1/1) ... [2019-12-07 16:57:56,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d152543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:56, skipping insertion in model container [2019-12-07 16:57:56,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:56" (1/1) ... [2019-12-07 16:57:56,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:57:56,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:57:57,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:57,153 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:57:57,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:57,236 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:57:57,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57 WrapperNode [2019-12-07 16:57:57,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:57,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:57:57,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:57:57,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:57:57,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:57:57,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:57:57,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:57:57,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:57:57,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... [2019-12-07 16:57:57,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:57:57,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:57:57,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:57:57,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:57:57,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/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-12-07 16:57:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:57:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:57:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 16:57:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:57:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:57:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:57:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 16:57:57,534 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:57:59,144 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 16:57:59,145 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 16:57:59,146 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:57:59,146 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:57:59,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:59 BoogieIcfgContainer [2019-12-07 16:57:59,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:57:59,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:57:59,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:57:59,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:57:59,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:57:56" (1/3) ... [2019-12-07 16:57:59,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4278f49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:57:59, skipping insertion in model container [2019-12-07 16:57:59,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:57" (2/3) ... [2019-12-07 16:57:59,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4278f49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:57:59, skipping insertion in model container [2019-12-07 16:57:59,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:59" (3/3) ... [2019-12-07 16:57:59,152 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-2.c [2019-12-07 16:57:59,160 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:57:59,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:57:59,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:57:59,192 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:57:59,192 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:57:59,192 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:57:59,192 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:57:59,192 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:57:59,192 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:57:59,193 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:57:59,193 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:57:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 16:57:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:57:59,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:59,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:59,217 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash 556191090, now seen corresponding path program 1 times [2019-12-07 16:57:59,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:57:59,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069306308] [2019-12-07 16:57:59,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:59,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:57:59,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:59,453 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:57:59,454 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:57:59,454 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:59,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:59,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:59,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:57:59,498 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:57:59,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:57:59,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:59,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:59,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:59,505 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:57:59,511 INFO L377 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 19 treesize of output 7 [2019-12-07 16:57:59,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:59,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:59,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:59,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:57:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:59,533 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:59,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069306308] [2019-12-07 16:57:59,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:59,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:57:59,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117330243] [2019-12-07 16:57:59,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:59,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:57:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:59,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:59,573 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 16:58:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:02,941 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-12-07 16:58:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:58:02,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 16:58:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:02,953 INFO L225 Difference]: With dead ends: 323 [2019-12-07 16:58:02,953 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 16:58:02,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 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-12-07 16:58:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 16:58:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 16:58:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 16:58:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-12-07 16:58:02,995 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 42 [2019-12-07 16:58:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:02,995 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-12-07 16:58:02,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:58:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-12-07 16:58:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:58:02,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:02,998 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:03,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:58:03,199 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1775050506, now seen corresponding path program 1 times [2019-12-07 16:58:03,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:03,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142977285] [2019-12-07 16:58:03,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:03,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:58:03,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:03,425 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:58:03,426 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:58:03,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:58:03,458 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:58:03,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:58:03,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:58:03,466 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:03,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,469 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:58:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:03,479 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:03,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142977285] [2019-12-07 16:58:03,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:03,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:03,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627342434] [2019-12-07 16:58:03,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:03,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:03,518 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 6 states. [2019-12-07 16:58:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:08,579 INFO L93 Difference]: Finished difference Result 407 states and 625 transitions. [2019-12-07 16:58:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:58:08,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 16:58:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:08,582 INFO L225 Difference]: With dead ends: 407 [2019-12-07 16:58:08,582 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 16:58:08,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:58:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 16:58:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 162. [2019-12-07 16:58:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 16:58:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2019-12-07 16:58:08,594 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 55 [2019-12-07 16:58:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2019-12-07 16:58:08,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:58:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2019-12-07 16:58:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:58:08,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:08,596 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:08,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:58:08,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1534527032, now seen corresponding path program 1 times [2019-12-07 16:58:08,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:08,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271109373] [2019-12-07 16:58:08,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:08,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:58:08,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:08,945 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 16:58:08,947 INFO L377 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 109 treesize of output 85 [2019-12-07 16:58:08,947 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:08,956 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:08,959 INFO L377 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 85 treesize of output 49 [2019-12-07 16:58:08,959 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:08,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:09,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:09,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 16:58:09,006 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:17,100 WARN L192 SmtUtils]: Spent 8.09 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 16:58:17,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:17,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:17,101 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 16:58:17,109 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:17,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:17,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:17,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:17,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:58:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:17,121 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:17,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271109373] [2019-12-07 16:58:17,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:17,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:58:17,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189027095] [2019-12-07 16:58:17,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:58:17,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:58:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:58:17,128 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand 4 states. [2019-12-07 16:58:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:22,018 INFO L93 Difference]: Finished difference Result 334 states and 516 transitions. [2019-12-07 16:58:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:58:22,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:58:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:22,020 INFO L225 Difference]: With dead ends: 334 [2019-12-07 16:58:22,021 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 16:58:22,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-12-07 16:58:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 16:58:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2019-12-07 16:58:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-12-07 16:58:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 277 transitions. [2019-12-07 16:58:22,029 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 277 transitions. Word has length 56 [2019-12-07 16:58:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:22,030 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 277 transitions. [2019-12-07 16:58:22,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:58:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 277 transitions. [2019-12-07 16:58:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:58:22,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:22,032 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:22,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:58:22,233 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:22,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash 672003245, now seen corresponding path program 1 times [2019-12-07 16:58:22,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:22,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841040730] [2019-12-07 16:58:22,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:22,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:58:22,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:22,428 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:58:22,428 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:58:22,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:22,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:22,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:22,438 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:58:22,460 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:58:22,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:58:22,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:22,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:22,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:22,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:58:22,468 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:22,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:22,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:22,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:22,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:58:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:22,480 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:22,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841040730] [2019-12-07 16:58:22,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:22,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465429415] [2019-12-07 16:58:22,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:22,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:22,512 INFO L87 Difference]: Start difference. First operand 178 states and 277 transitions. Second operand 6 states. [2019-12-07 16:58:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:27,486 INFO L93 Difference]: Finished difference Result 453 states and 699 transitions. [2019-12-07 16:58:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:58:27,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 16:58:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:27,488 INFO L225 Difference]: With dead ends: 453 [2019-12-07 16:58:27,489 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 16:58:27,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:58:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 16:58:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 179. [2019-12-07 16:58:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 16:58:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2019-12-07 16:58:27,496 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 56 [2019-12-07 16:58:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:27,496 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2019-12-07 16:58:27,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:58:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2019-12-07 16:58:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:58:27,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:27,497 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:27,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:58:27,699 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash -648850067, now seen corresponding path program 1 times [2019-12-07 16:58:27,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:27,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338707724] [2019-12-07 16:58:27,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:27,814 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:58:27,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:27,819 INFO L377 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-12-07 16:58:27,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:27,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:27,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:27,822 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:58:27,830 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:27,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:27,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:27,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:27,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:58:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:27,842 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:27,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338707724] [2019-12-07 16:58:27,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:27,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:27,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854452370] [2019-12-07 16:58:27,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:27,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:27,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:27,864 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand 6 states. [2019-12-07 16:58:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:34,143 INFO L93 Difference]: Finished difference Result 561 states and 867 transitions. [2019-12-07 16:58:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:58:34,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 16:58:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:34,146 INFO L225 Difference]: With dead ends: 561 [2019-12-07 16:58:34,146 INFO L226 Difference]: Without dead ends: 401 [2019-12-07 16:58:34,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:58:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-12-07 16:58:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 219. [2019-12-07 16:58:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 16:58:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 348 transitions. [2019-12-07 16:58:34,156 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 348 transitions. Word has length 56 [2019-12-07 16:58:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:34,156 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 348 transitions. [2019-12-07 16:58:34,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:58:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2019-12-07 16:58:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 16:58:34,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:34,157 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:34,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:58:34,359 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1158075641, now seen corresponding path program 1 times [2019-12-07 16:58:34,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:34,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447662520] [2019-12-07 16:58:34,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:34,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:58:34,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:34,512 INFO L377 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-12-07 16:58:34,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:34,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:34,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:34,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:58:34,522 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:34,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:34,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:34,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:34,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:58:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:34,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:34,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447662520] [2019-12-07 16:58:34,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:34,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:34,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113260693] [2019-12-07 16:58:34,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:34,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:34,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:34,555 INFO L87 Difference]: Start difference. First operand 219 states and 348 transitions. Second operand 6 states. [2019-12-07 16:58:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:40,681 INFO L93 Difference]: Finished difference Result 616 states and 971 transitions. [2019-12-07 16:58:40,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:58:40,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 16:58:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:40,684 INFO L225 Difference]: With dead ends: 616 [2019-12-07 16:58:40,684 INFO L226 Difference]: Without dead ends: 416 [2019-12-07 16:58:40,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:58:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-07 16:58:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 242. [2019-12-07 16:58:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 16:58:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 393 transitions. [2019-12-07 16:58:40,693 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 393 transitions. Word has length 57 [2019-12-07 16:58:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:40,694 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 393 transitions. [2019-12-07 16:58:40,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:58:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 393 transitions. [2019-12-07 16:58:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:58:40,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:40,695 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-12-07 16:58:40,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:58:40,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1036603596, now seen corresponding path program 1 times [2019-12-07 16:58:40,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:40,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264804586] [2019-12-07 16:58:40,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:41,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:58:41,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:41,108 INFO L377 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-12-07 16:58:41,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:41,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:41,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:41,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:58:41,119 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:41,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:41,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:41,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:41,121 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:58:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:41,132 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:41,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264804586] [2019-12-07 16:58:41,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:41,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:41,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265198265] [2019-12-07 16:58:41,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:41,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:41,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:41,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:41,156 INFO L87 Difference]: Start difference. First operand 242 states and 393 transitions. Second operand 6 states. [2019-12-07 16:58:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:49,882 INFO L93 Difference]: Finished difference Result 712 states and 1148 transitions. [2019-12-07 16:58:49,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:58:49,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-07 16:58:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:49,886 INFO L225 Difference]: With dead ends: 712 [2019-12-07 16:58:49,886 INFO L226 Difference]: Without dead ends: 489 [2019-12-07 16:58:49,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:58:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-12-07 16:58:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 306. [2019-12-07 16:58:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-07 16:58:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 505 transitions. [2019-12-07 16:58:49,897 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 505 transitions. Word has length 85 [2019-12-07 16:58:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:49,898 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 505 transitions. [2019-12-07 16:58:49,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:58:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 505 transitions. [2019-12-07 16:58:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 16:58:49,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:49,899 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-12-07 16:58:50,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:58:50,103 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1809695514, now seen corresponding path program 1 times [2019-12-07 16:58:50,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:50,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002774660] [2019-12-07 16:58:50,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:50,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:58:50,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:50,231 INFO L377 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-12-07 16:58:50,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:50,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:50,234 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:50,234 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:58:50,242 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:50,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:50,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:50,245 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:50,245 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:58:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:50,262 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:50,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002774660] [2019-12-07 16:58:50,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:50,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:50,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283790831] [2019-12-07 16:58:50,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:50,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:50,298 INFO L87 Difference]: Start difference. First operand 306 states and 505 transitions. Second operand 6 states. [2019-12-07 16:58:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:59,234 INFO L93 Difference]: Finished difference Result 804 states and 1303 transitions. [2019-12-07 16:58:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:58:59,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-12-07 16:58:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:59,237 INFO L225 Difference]: With dead ends: 804 [2019-12-07 16:58:59,237 INFO L226 Difference]: Without dead ends: 517 [2019-12-07 16:58:59,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:58:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-12-07 16:58:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 343. [2019-12-07 16:58:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 16:58:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 569 transitions. [2019-12-07 16:58:59,250 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 569 transitions. Word has length 90 [2019-12-07 16:58:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:59,251 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 569 transitions. [2019-12-07 16:58:59,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:58:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 569 transitions. [2019-12-07 16:58:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 16:58:59,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:59,253 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:58:59,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:58:59,454 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:58:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1340069638, now seen corresponding path program 1 times [2019-12-07 16:58:59,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:58:59,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647209100] [2019-12-07 16:58:59,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:59,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:58:59,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:59,639 INFO L377 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-12-07 16:58:59,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:59,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:59,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:59,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:58:59,651 INFO L377 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 19 treesize of output 7 [2019-12-07 16:58:59,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:59,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:59,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:59,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:58:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:59,666 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:59,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647209100] [2019-12-07 16:58:59,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:58:59,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:58:59,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821047194] [2019-12-07 16:58:59,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:58:59,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:58:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:58:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:58:59,690 INFO L87 Difference]: Start difference. First operand 343 states and 569 transitions. Second operand 6 states. [2019-12-07 16:59:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:09,269 INFO L93 Difference]: Finished difference Result 836 states and 1358 transitions. [2019-12-07 16:59:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:09,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-12-07 16:59:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:09,271 INFO L225 Difference]: With dead ends: 836 [2019-12-07 16:59:09,271 INFO L226 Difference]: Without dead ends: 512 [2019-12-07 16:59:09,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-07 16:59:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 343. [2019-12-07 16:59:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 16:59:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 567 transitions. [2019-12-07 16:59:09,280 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 567 transitions. Word has length 91 [2019-12-07 16:59:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:09,280 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 567 transitions. [2019-12-07 16:59:09,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 567 transitions. [2019-12-07 16:59:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:59:09,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:09,282 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-12-07 16:59:09,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:59:09,483 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1143515133, now seen corresponding path program 1 times [2019-12-07 16:59:09,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:09,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055309489] [2019-12-07 16:59:09,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:09,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:59:09,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:09,721 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:59:09,721 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:59:09,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:09,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:59:09,748 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:59:09,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:59:09,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:09,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,751 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:59:09,754 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:09,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:09,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:59:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:09,766 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:09,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055309489] [2019-12-07 16:59:09,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:09,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:09,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136069817] [2019-12-07 16:59:09,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:09,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:09,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:09,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:09,797 INFO L87 Difference]: Start difference. First operand 343 states and 567 transitions. Second operand 6 states. [2019-12-07 16:59:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:16,420 INFO L93 Difference]: Finished difference Result 757 states and 1230 transitions. [2019-12-07 16:59:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:16,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 16:59:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:16,423 INFO L225 Difference]: With dead ends: 757 [2019-12-07 16:59:16,423 INFO L226 Difference]: Without dead ends: 433 [2019-12-07 16:59:16,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-12-07 16:59:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 343. [2019-12-07 16:59:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 16:59:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2019-12-07 16:59:16,429 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 98 [2019-12-07 16:59:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:16,430 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2019-12-07 16:59:16,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2019-12-07 16:59:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:59:16,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:16,430 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-12-07 16:59:16,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 16:59:16,632 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash -977600023, now seen corresponding path program 1 times [2019-12-07 16:59:16,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:16,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623252769] [2019-12-07 16:59:16,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:16,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:59:16,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:16,953 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:59:16,953 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:59:16,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:16,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:16,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:16,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:59:16,980 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:59:16,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:59:16,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:16,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:16,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:16,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:59:16,986 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:16,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:16,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:16,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:16,988 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:59:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:16,998 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:17,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623252769] [2019-12-07 16:59:17,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:17,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:17,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416414961] [2019-12-07 16:59:17,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:17,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:17,028 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 6 states. [2019-12-07 16:59:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:21,451 INFO L93 Difference]: Finished difference Result 757 states and 1217 transitions. [2019-12-07 16:59:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:21,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 16:59:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:21,454 INFO L225 Difference]: With dead ends: 757 [2019-12-07 16:59:21,454 INFO L226 Difference]: Without dead ends: 433 [2019-12-07 16:59:21,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-12-07 16:59:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 343. [2019-12-07 16:59:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 16:59:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 553 transitions. [2019-12-07 16:59:21,461 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 553 transitions. Word has length 98 [2019-12-07 16:59:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:21,461 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 553 transitions. [2019-12-07 16:59:21,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 553 transitions. [2019-12-07 16:59:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:59:21,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:21,462 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:59:21,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 16:59:21,663 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -347503194, now seen corresponding path program 1 times [2019-12-07 16:59:21,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:21,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744202178] [2019-12-07 16:59:21,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:21,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:59:21,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:21,891 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:59:21,891 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:59:21,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:21,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:21,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:21,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:59:21,931 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:59:21,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:59:21,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:21,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:21,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:21,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:59:21,939 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:21,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:21,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:21,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:21,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:59:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:21,952 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:21,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744202178] [2019-12-07 16:59:21,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:21,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:21,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846152949] [2019-12-07 16:59:21,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:21,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:21,985 INFO L87 Difference]: Start difference. First operand 343 states and 553 transitions. Second operand 6 states. [2019-12-07 16:59:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:25,626 INFO L93 Difference]: Finished difference Result 757 states and 1204 transitions. [2019-12-07 16:59:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:25,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 16:59:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:25,629 INFO L225 Difference]: With dead ends: 757 [2019-12-07 16:59:25,629 INFO L226 Difference]: Without dead ends: 433 [2019-12-07 16:59:25,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-12-07 16:59:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 343. [2019-12-07 16:59:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 16:59:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 546 transitions. [2019-12-07 16:59:25,635 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 546 transitions. Word has length 99 [2019-12-07 16:59:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:25,635 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 546 transitions. [2019-12-07 16:59:25,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 546 transitions. [2019-12-07 16:59:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:59:25,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:25,636 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:59:25,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 16:59:25,838 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1300684249, now seen corresponding path program 1 times [2019-12-07 16:59:25,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:25,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762142808] [2019-12-07 16:59:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:26,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:59:26,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:26,013 INFO L377 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-12-07 16:59:26,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:26,015 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:26,015 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:26,015 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:59:26,023 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:26,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:26,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:26,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:26,025 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:59:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:26,040 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:26,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762142808] [2019-12-07 16:59:26,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:26,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936088374] [2019-12-07 16:59:26,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:26,066 INFO L87 Difference]: Start difference. First operand 343 states and 546 transitions. Second operand 6 states. [2019-12-07 16:59:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:34,143 INFO L93 Difference]: Finished difference Result 874 states and 1374 transitions. [2019-12-07 16:59:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:34,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 16:59:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:34,146 INFO L225 Difference]: With dead ends: 874 [2019-12-07 16:59:34,146 INFO L226 Difference]: Without dead ends: 550 [2019-12-07 16:59:34,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-12-07 16:59:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2019-12-07 16:59:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-07 16:59:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 616 transitions. [2019-12-07 16:59:34,154 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 616 transitions. Word has length 99 [2019-12-07 16:59:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:34,154 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 616 transitions. [2019-12-07 16:59:34,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 616 transitions. [2019-12-07 16:59:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 16:59:34,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:34,155 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-12-07 16:59:34,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 16:59:34,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1666378724, now seen corresponding path program 1 times [2019-12-07 16:59:34,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:34,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347742333] [2019-12-07 16:59:34,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:34,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:59:34,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:34,591 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:59:34,591 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:59:34,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:34,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:34,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:34,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:59:34,617 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:59:34,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:59:34,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:34,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:34,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:34,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:59:34,623 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:34,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:34,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:34,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:34,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:59:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:34,635 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:34,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347742333] [2019-12-07 16:59:34,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:34,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:34,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096077369] [2019-12-07 16:59:34,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:34,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:34,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:34,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:34,667 INFO L87 Difference]: Start difference. First operand 386 states and 616 transitions. Second operand 6 states. [2019-12-07 16:59:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:38,997 INFO L93 Difference]: Finished difference Result 843 states and 1331 transitions. [2019-12-07 16:59:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:38,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 16:59:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:39,000 INFO L225 Difference]: With dead ends: 843 [2019-12-07 16:59:39,000 INFO L226 Difference]: Without dead ends: 476 [2019-12-07 16:59:39,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-07 16:59:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 386. [2019-12-07 16:59:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-07 16:59:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 608 transitions. [2019-12-07 16:59:39,007 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 608 transitions. Word has length 100 [2019-12-07 16:59:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:39,007 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 608 transitions. [2019-12-07 16:59:39,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 608 transitions. [2019-12-07 16:59:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 16:59:39,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:39,008 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:59:39,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 16:59:39,208 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1259322917, now seen corresponding path program 1 times [2019-12-07 16:59:39,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:39,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45749918] [2019-12-07 16:59:39,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:39,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:59:39,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:39,360 INFO L377 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-12-07 16:59:39,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:39,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:39,363 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:39,363 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:59:39,370 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:39,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:39,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:39,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:39,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:59:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:39,386 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:39,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45749918] [2019-12-07 16:59:39,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:39,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:39,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485206220] [2019-12-07 16:59:39,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:39,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:39,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:39,411 INFO L87 Difference]: Start difference. First operand 386 states and 608 transitions. Second operand 6 states. [2019-12-07 16:59:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:47,087 INFO L93 Difference]: Finished difference Result 915 states and 1424 transitions. [2019-12-07 16:59:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:47,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 16:59:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:47,090 INFO L225 Difference]: With dead ends: 915 [2019-12-07 16:59:47,090 INFO L226 Difference]: Without dead ends: 544 [2019-12-07 16:59:47,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-07 16:59:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 388. [2019-12-07 16:59:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-07 16:59:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 611 transitions. [2019-12-07 16:59:47,097 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 611 transitions. Word has length 100 [2019-12-07 16:59:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:47,097 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 611 transitions. [2019-12-07 16:59:47,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 611 transitions. [2019-12-07 16:59:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 16:59:47,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:47,098 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-12-07 16:59:47,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 16:59:47,299 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:47,299 INFO L82 PathProgramCache]: Analyzing trace with hash -667041855, now seen corresponding path program 1 times [2019-12-07 16:59:47,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:47,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878118914] [2019-12-07 16:59:47,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:47,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:59:47,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:47,559 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:59:47,559 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:59:47,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:47,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:47,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:47,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 16:59:47,590 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:59:47,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 16:59:47,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:47,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:47,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:47,593 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 16:59:47,596 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:47,596 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:47,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:47,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:47,598 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 16:59:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:47,611 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 16:59:47,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878118914] [2019-12-07 16:59:47,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:47,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:47,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308217378] [2019-12-07 16:59:47,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:47,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:47,646 INFO L87 Difference]: Start difference. First operand 388 states and 611 transitions. Second operand 6 states. [2019-12-07 16:59:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:52,752 INFO L93 Difference]: Finished difference Result 823 states and 1289 transitions. [2019-12-07 16:59:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:52,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 16:59:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:52,755 INFO L225 Difference]: With dead ends: 823 [2019-12-07 16:59:52,755 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 16:59:52,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 16:59:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 388. [2019-12-07 16:59:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-07 16:59:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 603 transitions. [2019-12-07 16:59:52,765 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 603 transitions. Word has length 101 [2019-12-07 16:59:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:52,765 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 603 transitions. [2019-12-07 16:59:52,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 603 transitions. [2019-12-07 16:59:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 16:59:52,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:52,767 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 16:59:52,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:59:52,968 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:59:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1006453231, now seen corresponding path program 1 times [2019-12-07 16:59:52,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:59:52,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021122910] [2019-12-07 16:59:52,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 16:59:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:53,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:59:53,164 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:53,167 INFO L377 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-12-07 16:59:53,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:53,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:53,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:53,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:59:53,177 INFO L377 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 19 treesize of output 7 [2019-12-07 16:59:53,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:53,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:53,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:53,179 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:59:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 16:59:53,192 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 16:59:53,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021122910] [2019-12-07 16:59:53,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:53,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:59:53,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581919014] [2019-12-07 16:59:53,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:53,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:59:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:53,219 INFO L87 Difference]: Start difference. First operand 388 states and 603 transitions. Second operand 6 states. [2019-12-07 17:00:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:00,083 INFO L93 Difference]: Finished difference Result 935 states and 1444 transitions. [2019-12-07 17:00:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:00,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-07 17:00:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:00,086 INFO L225 Difference]: With dead ends: 935 [2019-12-07 17:00:00,086 INFO L226 Difference]: Without dead ends: 566 [2019-12-07 17:00:00,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-12-07 17:00:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 418. [2019-12-07 17:00:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 17:00:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 645 transitions. [2019-12-07 17:00:00,094 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 645 transitions. Word has length 112 [2019-12-07 17:00:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:00,094 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 645 transitions. [2019-12-07 17:00:00,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 645 transitions. [2019-12-07 17:00:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 17:00:00,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:00,095 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 17:00:00,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:00:00,296 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2051699338, now seen corresponding path program 1 times [2019-12-07 17:00:00,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:00,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205657915] [2019-12-07 17:00:00,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:00,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:00,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:00,577 INFO L377 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-12-07 17:00:00,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:00,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:00,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:00,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:00,587 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:00,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:00,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:00,591 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:00,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:00:00,605 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:00:00,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205657915] [2019-12-07 17:00:00,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:00,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:00,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400142807] [2019-12-07 17:00:00,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:00,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:00,631 INFO L87 Difference]: Start difference. First operand 418 states and 645 transitions. Second operand 6 states. [2019-12-07 17:00:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:08,541 INFO L93 Difference]: Finished difference Result 951 states and 1459 transitions. [2019-12-07 17:00:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:08,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-12-07 17:00:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:08,545 INFO L225 Difference]: With dead ends: 951 [2019-12-07 17:00:08,545 INFO L226 Difference]: Without dead ends: 552 [2019-12-07 17:00:08,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-07 17:00:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 418. [2019-12-07 17:00:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 17:00:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 639 transitions. [2019-12-07 17:00:08,555 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 639 transitions. Word has length 113 [2019-12-07 17:00:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:08,555 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 639 transitions. [2019-12-07 17:00:08,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 639 transitions. [2019-12-07 17:00:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 17:00:08,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:08,557 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1] [2019-12-07 17:00:08,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:00:08,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -720621489, now seen corresponding path program 1 times [2019-12-07 17:00:08,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:08,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331158303] [2019-12-07 17:00:08,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:08,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:08,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:08,912 INFO L377 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-12-07 17:00:08,912 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:08,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:08,914 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:08,914 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:08,921 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:08,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:08,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:08,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:08,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:00:08,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:00:08,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331158303] [2019-12-07 17:00:08,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:08,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:08,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436963719] [2019-12-07 17:00:08,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:08,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:08,964 INFO L87 Difference]: Start difference. First operand 418 states and 639 transitions. Second operand 6 states. [2019-12-07 17:00:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:16,271 INFO L93 Difference]: Finished difference Result 993 states and 1510 transitions. [2019-12-07 17:00:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:16,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 17:00:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:16,274 INFO L225 Difference]: With dead ends: 993 [2019-12-07 17:00:16,275 INFO L226 Difference]: Without dead ends: 594 [2019-12-07 17:00:16,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-07 17:00:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 446. [2019-12-07 17:00:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-07 17:00:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 676 transitions. [2019-12-07 17:00:16,283 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 676 transitions. Word has length 115 [2019-12-07 17:00:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:16,283 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 676 transitions. [2019-12-07 17:00:16,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 676 transitions. [2019-12-07 17:00:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 17:00:16,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:16,284 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 17:00:16,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:00:16,486 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1262027464, now seen corresponding path program 1 times [2019-12-07 17:00:16,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:16,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76555424] [2019-12-07 17:00:16,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:16,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:16,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:16,683 INFO L377 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-12-07 17:00:16,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:16,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:16,686 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:16,686 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:16,693 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:16,693 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:16,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:16,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:16,695 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:00:16,710 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:00:16,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76555424] [2019-12-07 17:00:16,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:16,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:16,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558881975] [2019-12-07 17:00:16,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:16,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:16,736 INFO L87 Difference]: Start difference. First operand 446 states and 676 transitions. Second operand 6 states. [2019-12-07 17:00:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:26,085 INFO L93 Difference]: Finished difference Result 999 states and 1506 transitions. [2019-12-07 17:00:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:26,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-12-07 17:00:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:26,088 INFO L225 Difference]: With dead ends: 999 [2019-12-07 17:00:26,088 INFO L226 Difference]: Without dead ends: 572 [2019-12-07 17:00:26,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-07 17:00:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 446. [2019-12-07 17:00:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-07 17:00:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 669 transitions. [2019-12-07 17:00:26,096 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 669 transitions. Word has length 116 [2019-12-07 17:00:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:26,097 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 669 transitions. [2019-12-07 17:00:26,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 669 transitions. [2019-12-07 17:00:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 17:00:26,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:26,098 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 17:00:26,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 17:00:26,299 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:26,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash 743777634, now seen corresponding path program 1 times [2019-12-07 17:00:26,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:26,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600335296] [2019-12-07 17:00:26,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:26,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:26,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:26,570 INFO L377 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-12-07 17:00:26,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:26,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:26,580 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:26,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:26,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:00:26,598 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:00:26,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600335296] [2019-12-07 17:00:26,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:26,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:26,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464682428] [2019-12-07 17:00:26,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:26,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:26,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:26,629 INFO L87 Difference]: Start difference. First operand 446 states and 669 transitions. Second operand 6 states. [2019-12-07 17:00:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:35,542 INFO L93 Difference]: Finished difference Result 1041 states and 1553 transitions. [2019-12-07 17:00:35,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:35,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-12-07 17:00:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:35,545 INFO L225 Difference]: With dead ends: 1041 [2019-12-07 17:00:35,545 INFO L226 Difference]: Without dead ends: 614 [2019-12-07 17:00:35,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-12-07 17:00:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 481. [2019-12-07 17:00:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 17:00:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 718 transitions. [2019-12-07 17:00:35,556 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 718 transitions. Word has length 122 [2019-12-07 17:00:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:35,556 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 718 transitions. [2019-12-07 17:00:35,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 718 transitions. [2019-12-07 17:00:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 17:00:35,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:35,557 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 17:00:35,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 17:00:35,759 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash 649865390, now seen corresponding path program 1 times [2019-12-07 17:00:35,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:35,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660162522] [2019-12-07 17:00:35,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:35,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:35,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:35,951 INFO L377 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-12-07 17:00:35,952 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:35,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:35,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:35,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:35,961 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:35,961 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:35,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:35,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:35,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:00:35,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:00:36,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660162522] [2019-12-07 17:00:36,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:36,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:36,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332554943] [2019-12-07 17:00:36,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:36,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:36,006 INFO L87 Difference]: Start difference. First operand 481 states and 718 transitions. Second operand 6 states. [2019-12-07 17:00:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:44,469 INFO L93 Difference]: Finished difference Result 1067 states and 1586 transitions. [2019-12-07 17:00:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:44,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-12-07 17:00:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:44,472 INFO L225 Difference]: With dead ends: 1067 [2019-12-07 17:00:44,472 INFO L226 Difference]: Without dead ends: 605 [2019-12-07 17:00:44,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-07 17:00:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 481. [2019-12-07 17:00:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 17:00:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 714 transitions. [2019-12-07 17:00:44,481 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 714 transitions. Word has length 123 [2019-12-07 17:00:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:44,481 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 714 transitions. [2019-12-07 17:00:44,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 714 transitions. [2019-12-07 17:00:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 17:00:44,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:44,482 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:00:44,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 17:00:44,683 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1470115127, now seen corresponding path program 1 times [2019-12-07 17:00:44,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:44,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249494673] [2019-12-07 17:00:44,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:44,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:44,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:44,895 INFO L377 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-12-07 17:00:44,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:44,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:44,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:44,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:44,905 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:44,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:44,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:44,907 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:44,907 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 17:00:44,928 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 17:00:44,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249494673] [2019-12-07 17:00:44,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:44,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:44,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651642851] [2019-12-07 17:00:44,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:44,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:44,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:44,964 INFO L87 Difference]: Start difference. First operand 481 states and 714 transitions. Second operand 6 states. [2019-12-07 17:00:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:51,311 INFO L93 Difference]: Finished difference Result 1110 states and 1638 transitions. [2019-12-07 17:00:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:51,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-12-07 17:00:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:51,314 INFO L225 Difference]: With dead ends: 1110 [2019-12-07 17:00:51,314 INFO L226 Difference]: Without dead ends: 648 [2019-12-07 17:00:51,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-12-07 17:00:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 524. [2019-12-07 17:00:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 17:00:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 773 transitions. [2019-12-07 17:00:51,323 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 773 transitions. Word has length 140 [2019-12-07 17:00:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:51,323 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 773 transitions. [2019-12-07 17:00:51,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 773 transitions. [2019-12-07 17:00:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 17:00:51,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:51,324 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:00:51,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 17:00:51,525 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -941828253, now seen corresponding path program 1 times [2019-12-07 17:00:51,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:51,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403933080] [2019-12-07 17:00:51,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:51,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:51,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:51,661 INFO L377 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-12-07 17:00:51,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:51,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:51,664 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:51,664 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:51,671 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:51,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:51,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:51,673 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:51,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 17:00:51,699 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 17:00:51,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403933080] [2019-12-07 17:00:51,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:51,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:51,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249429824] [2019-12-07 17:00:51,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:51,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:51,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:51,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:51,732 INFO L87 Difference]: Start difference. First operand 524 states and 773 transitions. Second operand 6 states. [2019-12-07 17:00:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:56,919 INFO L93 Difference]: Finished difference Result 1151 states and 1692 transitions. [2019-12-07 17:00:56,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:56,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-12-07 17:00:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:56,922 INFO L225 Difference]: With dead ends: 1151 [2019-12-07 17:00:56,922 INFO L226 Difference]: Without dead ends: 630 [2019-12-07 17:00:56,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-07 17:00:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 516. [2019-12-07 17:00:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-07 17:00:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 759 transitions. [2019-12-07 17:00:56,932 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 759 transitions. Word has length 141 [2019-12-07 17:00:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:56,932 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 759 transitions. [2019-12-07 17:00:56,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 759 transitions. [2019-12-07 17:00:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 17:00:56,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:56,933 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-12-07 17:00:57,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 17:00:57,135 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash 878777420, now seen corresponding path program 1 times [2019-12-07 17:00:57,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:00:57,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662635705] [2019-12-07 17:00:57,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:57,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:57,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:57,310 INFO L377 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-12-07 17:00:57,311 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:57,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:57,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:57,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:00:57,319 INFO L377 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 19 treesize of output 7 [2019-12-07 17:00:57,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:57,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:57,321 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:57,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:00:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 17:00:57,338 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 17:00:57,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662635705] [2019-12-07 17:00:57,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:57,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:57,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11300604] [2019-12-07 17:00:57,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:57,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:00:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:57,368 INFO L87 Difference]: Start difference. First operand 516 states and 759 transitions. Second operand 6 states. [2019-12-07 17:01:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:02,748 INFO L93 Difference]: Finished difference Result 1161 states and 1705 transitions. [2019-12-07 17:01:02,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:02,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-12-07 17:01:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:02,752 INFO L225 Difference]: With dead ends: 1161 [2019-12-07 17:01:02,752 INFO L226 Difference]: Without dead ends: 664 [2019-12-07 17:01:02,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-12-07 17:01:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 542. [2019-12-07 17:01:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-07 17:01:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 789 transitions. [2019-12-07 17:01:02,762 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 789 transitions. Word has length 143 [2019-12-07 17:01:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:02,763 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 789 transitions. [2019-12-07 17:01:02,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 789 transitions. [2019-12-07 17:01:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 17:01:02,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:02,764 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 17:01:02,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 17:01:02,965 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash -524525915, now seen corresponding path program 1 times [2019-12-07 17:01:02,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:02,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061783570] [2019-12-07 17:01:02,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:03,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:03,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:03,171 INFO L377 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-12-07 17:01:03,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:03,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:03,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:03,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:03,180 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:03,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:03,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:03,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:03,182 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 17:01:03,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 17:01:03,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061783570] [2019-12-07 17:01:03,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:03,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:03,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854863180] [2019-12-07 17:01:03,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:03,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:03,231 INFO L87 Difference]: Start difference. First operand 542 states and 789 transitions. Second operand 6 states. [2019-12-07 17:01:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:09,111 INFO L93 Difference]: Finished difference Result 1177 states and 1711 transitions. [2019-12-07 17:01:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:09,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-12-07 17:01:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:09,114 INFO L225 Difference]: With dead ends: 1177 [2019-12-07 17:01:09,114 INFO L226 Difference]: Without dead ends: 654 [2019-12-07 17:01:09,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-12-07 17:01:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 542. [2019-12-07 17:01:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-07 17:01:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 779 transitions. [2019-12-07 17:01:09,124 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 779 transitions. Word has length 144 [2019-12-07 17:01:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:09,124 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 779 transitions. [2019-12-07 17:01:09,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 779 transitions. [2019-12-07 17:01:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 17:01:09,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:09,125 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 17:01:09,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 17:01:09,326 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1333893578, now seen corresponding path program 1 times [2019-12-07 17:01:09,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:09,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397360075] [2019-12-07 17:01:09,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:09,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:09,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:09,510 INFO L377 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-12-07 17:01:09,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:09,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:09,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:09,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:09,520 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:09,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:09,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:09,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:09,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:01:09,548 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:01:09,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397360075] [2019-12-07 17:01:09,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:09,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:09,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106995503] [2019-12-07 17:01:09,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:09,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:09,587 INFO L87 Difference]: Start difference. First operand 542 states and 779 transitions. Second operand 6 states. [2019-12-07 17:01:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:15,860 INFO L93 Difference]: Finished difference Result 1211 states and 1739 transitions. [2019-12-07 17:01:15,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:15,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-12-07 17:01:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:15,863 INFO L225 Difference]: With dead ends: 1211 [2019-12-07 17:01:15,863 INFO L226 Difference]: Without dead ends: 688 [2019-12-07 17:01:15,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-07 17:01:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 575. [2019-12-07 17:01:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 17:01:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 821 transitions. [2019-12-07 17:01:15,874 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 821 transitions. Word has length 154 [2019-12-07 17:01:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:15,874 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 821 transitions. [2019-12-07 17:01:15,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 821 transitions. [2019-12-07 17:01:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 17:01:15,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:15,875 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 17:01:16,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 17:01:16,076 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1235733386, now seen corresponding path program 1 times [2019-12-07 17:01:16,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:16,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452934271] [2019-12-07 17:01:16,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:16,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:16,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:16,222 INFO L377 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-12-07 17:01:16,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:16,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:16,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:16,225 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:16,233 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:16,233 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:16,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:16,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:16,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:01:16,257 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:01:16,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452934271] [2019-12-07 17:01:16,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:16,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:16,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063565702] [2019-12-07 17:01:16,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:16,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:16,289 INFO L87 Difference]: Start difference. First operand 575 states and 821 transitions. Second operand 6 states. [2019-12-07 17:01:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:22,313 INFO L93 Difference]: Finished difference Result 1239 states and 1768 transitions. [2019-12-07 17:01:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:22,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-12-07 17:01:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:22,318 INFO L225 Difference]: With dead ends: 1239 [2019-12-07 17:01:22,318 INFO L226 Difference]: Without dead ends: 665 [2019-12-07 17:01:22,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-12-07 17:01:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 566. [2019-12-07 17:01:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-12-07 17:01:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 801 transitions. [2019-12-07 17:01:22,329 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 801 transitions. Word has length 155 [2019-12-07 17:01:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:22,329 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 801 transitions. [2019-12-07 17:01:22,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 801 transitions. [2019-12-07 17:01:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 17:01:22,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:22,330 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-12-07 17:01:22,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 17:01:22,531 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2003414685, now seen corresponding path program 1 times [2019-12-07 17:01:22,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:22,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617848873] [2019-12-07 17:01:22,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:22,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:22,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:22,692 INFO L377 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-12-07 17:01:22,692 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:22,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:22,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:22,696 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:22,703 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:22,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:22,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:22,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:22,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:01:22,724 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:01:22,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617848873] [2019-12-07 17:01:22,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:22,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:22,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337786254] [2019-12-07 17:01:22,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:22,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:22,755 INFO L87 Difference]: Start difference. First operand 566 states and 801 transitions. Second operand 6 states. [2019-12-07 17:01:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:30,553 INFO L93 Difference]: Finished difference Result 1237 states and 1755 transitions. [2019-12-07 17:01:30,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:30,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-12-07 17:01:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:30,557 INFO L225 Difference]: With dead ends: 1237 [2019-12-07 17:01:30,557 INFO L226 Difference]: Without dead ends: 690 [2019-12-07 17:01:30,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-12-07 17:01:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 588. [2019-12-07 17:01:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-07 17:01:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 821 transitions. [2019-12-07 17:01:30,569 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 821 transitions. Word has length 162 [2019-12-07 17:01:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:30,569 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 821 transitions. [2019-12-07 17:01:30,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 821 transitions. [2019-12-07 17:01:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 17:01:30,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:30,570 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 17:01:30,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 17:01:30,771 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1015508906, now seen corresponding path program 1 times [2019-12-07 17:01:30,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:30,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211984163] [2019-12-07 17:01:30,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:30,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:30,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:30,993 INFO L377 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-12-07 17:01:30,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:30,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:30,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:30,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:31,003 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:31,003 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:31,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:31,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:31,005 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:01:31,024 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:01:31,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211984163] [2019-12-07 17:01:31,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:31,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:31,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583805158] [2019-12-07 17:01:31,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:31,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:31,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:31,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:31,056 INFO L87 Difference]: Start difference. First operand 588 states and 821 transitions. Second operand 6 states. [2019-12-07 17:01:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:38,352 INFO L93 Difference]: Finished difference Result 1252 states and 1751 transitions. [2019-12-07 17:01:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:38,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-12-07 17:01:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:38,356 INFO L225 Difference]: With dead ends: 1252 [2019-12-07 17:01:38,356 INFO L226 Difference]: Without dead ends: 683 [2019-12-07 17:01:38,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-07 17:01:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 588. [2019-12-07 17:01:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-07 17:01:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 809 transitions. [2019-12-07 17:01:38,368 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 809 transitions. Word has length 163 [2019-12-07 17:01:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:38,368 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 809 transitions. [2019-12-07 17:01:38,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 809 transitions. [2019-12-07 17:01:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 17:01:38,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:38,369 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 17:01:38,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 17:01:38,570 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash -750283500, now seen corresponding path program 1 times [2019-12-07 17:01:38,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:38,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832638191] [2019-12-07 17:01:38,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:38,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:38,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:38,773 INFO L377 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-12-07 17:01:38,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:38,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:38,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:38,775 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:38,782 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:38,782 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:38,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:38,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:38,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 17:01:38,803 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 17:01:38,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832638191] [2019-12-07 17:01:38,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:38,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:38,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492213802] [2019-12-07 17:01:38,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:38,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:38,834 INFO L87 Difference]: Start difference. First operand 588 states and 809 transitions. Second operand 6 states. [2019-12-07 17:01:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:46,003 INFO L93 Difference]: Finished difference Result 1277 states and 1761 transitions. [2019-12-07 17:01:46,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:46,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-12-07 17:01:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:46,008 INFO L225 Difference]: With dead ends: 1277 [2019-12-07 17:01:46,008 INFO L226 Difference]: Without dead ends: 708 [2019-12-07 17:01:46,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-07 17:01:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 612. [2019-12-07 17:01:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-12-07 17:01:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 831 transitions. [2019-12-07 17:01:46,020 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 831 transitions. Word has length 165 [2019-12-07 17:01:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:46,021 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 831 transitions. [2019-12-07 17:01:46,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 831 transitions. [2019-12-07 17:01:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 17:01:46,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:46,022 INFO L410 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, 1] [2019-12-07 17:01:46,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 17:01:46,222 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 919067594, now seen corresponding path program 1 times [2019-12-07 17:01:46,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:46,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773187897] [2019-12-07 17:01:46,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:46,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:01:46,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 17:01:46,457 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 17:01:46,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773187897] [2019-12-07 17:01:46,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:46,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 17:01:46,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251850759] [2019-12-07 17:01:46,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:01:46,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:01:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:01:46,483 INFO L87 Difference]: Start difference. First operand 612 states and 831 transitions. Second operand 3 states. [2019-12-07 17:01:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:47,978 INFO L93 Difference]: Finished difference Result 1791 states and 2439 transitions. [2019-12-07 17:01:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:01:47,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 17:01:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:47,982 INFO L225 Difference]: With dead ends: 1791 [2019-12-07 17:01:47,982 INFO L226 Difference]: Without dead ends: 1198 [2019-12-07 17:01:47,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 327 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-12-07 17:01:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-12-07 17:01:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2019-12-07 17:01:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-12-07 17:01:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1622 transitions. [2019-12-07 17:01:48,006 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1622 transitions. Word has length 165 [2019-12-07 17:01:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:48,007 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1622 transitions. [2019-12-07 17:01:48,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:01:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1622 transitions. [2019-12-07 17:01:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:01:48,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:48,008 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 17:01:48,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 17:01:48,209 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 852491789, now seen corresponding path program 1 times [2019-12-07 17:01:48,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:48,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169262773] [2019-12-07 17:01:48,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:48,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:48,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:48,437 INFO L377 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-12-07 17:01:48,437 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:48,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:48,439 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:48,440 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:01:48,447 INFO L377 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 19 treesize of output 7 [2019-12-07 17:01:48,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:01:48,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:48,448 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:01:48,448 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:01:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 17:01:48,468 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 17:01:48,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169262773] [2019-12-07 17:01:48,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:48,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:01:48,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228840323] [2019-12-07 17:01:48,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:48,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:48,500 INFO L87 Difference]: Start difference. First operand 1198 states and 1622 transitions. Second operand 6 states. [2019-12-07 17:01:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:54,521 INFO L93 Difference]: Finished difference Result 2554 states and 3458 transitions. [2019-12-07 17:01:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:01:54,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-12-07 17:01:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:54,530 INFO L225 Difference]: With dead ends: 2554 [2019-12-07 17:01:54,530 INFO L226 Difference]: Without dead ends: 1359 [2019-12-07 17:01:54,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:01:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-12-07 17:01:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1190. [2019-12-07 17:01:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2019-12-07 17:01:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1586 transitions. [2019-12-07 17:01:54,563 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1586 transitions. Word has length 166 [2019-12-07 17:01:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:54,564 INFO L462 AbstractCegarLoop]: Abstraction has 1190 states and 1586 transitions. [2019-12-07 17:01:54,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1586 transitions. [2019-12-07 17:01:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:01:54,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:54,565 INFO L410 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, 1, 1] [2019-12-07 17:01:54,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 17:01:54,765 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash 152025175, now seen corresponding path program 1 times [2019-12-07 17:01:54,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:54,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023920518] [2019-12-07 17:01:54,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:54,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:01:54,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:01:54,939 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:01:54,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023920518] [2019-12-07 17:01:54,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:54,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 17:01:54,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727079961] [2019-12-07 17:01:54,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:01:54,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:01:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:01:54,958 INFO L87 Difference]: Start difference. First operand 1190 states and 1586 transitions. Second operand 3 states. [2019-12-07 17:01:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:56,069 INFO L93 Difference]: Finished difference Result 2908 states and 3883 transitions. [2019-12-07 17:01:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:01:56,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 17:01:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:56,074 INFO L225 Difference]: With dead ends: 2908 [2019-12-07 17:01:56,074 INFO L226 Difference]: Without dead ends: 1737 [2019-12-07 17:01:56,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 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-12-07 17:01:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2019-12-07 17:01:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1735. [2019-12-07 17:01:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-12-07 17:01:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2311 transitions. [2019-12-07 17:01:56,109 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2311 transitions. Word has length 166 [2019-12-07 17:01:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:56,110 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2311 transitions. [2019-12-07 17:01:56,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:01:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2311 transitions. [2019-12-07 17:01:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 17:01:56,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:56,111 INFO L410 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, 1, 1, 1] [2019-12-07 17:01:56,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 17:01:56,312 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1379611756, now seen corresponding path program 1 times [2019-12-07 17:01:56,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:56,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139957677] [2019-12-07 17:01:56,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:56,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:01:56,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:01:56,542 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:01:56,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139957677] [2019-12-07 17:01:56,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:56,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 17:01:56,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453318806] [2019-12-07 17:01:56,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:01:56,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:56,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:01:56,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:01:56,561 INFO L87 Difference]: Start difference. First operand 1735 states and 2311 transitions. Second operand 3 states. [2019-12-07 17:01:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:57,380 INFO L93 Difference]: Finished difference Result 3989 states and 5326 transitions. [2019-12-07 17:01:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:01:57,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 17:01:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:57,388 INFO L225 Difference]: With dead ends: 3989 [2019-12-07 17:01:57,388 INFO L226 Difference]: Without dead ends: 2273 [2019-12-07 17:01:57,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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-12-07 17:01:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-12-07 17:01:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2250. [2019-12-07 17:01:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2019-12-07 17:01:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3008 transitions. [2019-12-07 17:01:57,445 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3008 transitions. Word has length 167 [2019-12-07 17:01:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:57,445 INFO L462 AbstractCegarLoop]: Abstraction has 2250 states and 3008 transitions. [2019-12-07 17:01:57,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:01:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3008 transitions. [2019-12-07 17:01:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 17:01:57,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:57,447 INFO L410 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, 1, 1, 1] [2019-12-07 17:01:57,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 17:01:57,648 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash 794840106, now seen corresponding path program 1 times [2019-12-07 17:01:57,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:57,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843246807] [2019-12-07 17:01:57,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:57,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:01:57,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:01:57,846 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:01:57,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843246807] [2019-12-07 17:01:57,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:57,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 17:01:57,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281561555] [2019-12-07 17:01:57,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:01:57,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:01:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:01:57,862 INFO L87 Difference]: Start difference. First operand 2250 states and 3008 transitions. Second operand 3 states. [2019-12-07 17:01:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:58,563 INFO L93 Difference]: Finished difference Result 4530 states and 6061 transitions. [2019-12-07 17:01:58,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:01:58,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 17:01:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:58,570 INFO L225 Difference]: With dead ends: 4530 [2019-12-07 17:01:58,571 INFO L226 Difference]: Without dead ends: 2299 [2019-12-07 17:01:58,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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-12-07 17:01:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-12-07 17:01:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2019-12-07 17:01:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-12-07 17:01:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3074 transitions. [2019-12-07 17:01:58,618 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3074 transitions. Word has length 167 [2019-12-07 17:01:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:58,619 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 3074 transitions. [2019-12-07 17:01:58,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:01:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3074 transitions. [2019-12-07 17:01:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 17:01:58,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:58,620 INFO L410 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, 1, 1, 1] [2019-12-07 17:01:58,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 17:01:58,821 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:58,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 530192616, now seen corresponding path program 1 times [2019-12-07 17:01:58,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:58,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455281464] [2019-12-07 17:01:58,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:59,039 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:01:59,040 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 17:01:59,055 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 17:01:59,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455281464] [2019-12-07 17:01:59,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:59,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 17:01:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009898336] [2019-12-07 17:01:59,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:01:59,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:01:59,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:01:59,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:01:59,070 INFO L87 Difference]: Start difference. First operand 2299 states and 3074 transitions. Second operand 3 states. [2019-12-07 17:01:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:59,127 INFO L93 Difference]: Finished difference Result 4603 states and 6158 transitions. [2019-12-07 17:01:59,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:01:59,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 17:01:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:59,132 INFO L225 Difference]: With dead ends: 4603 [2019-12-07 17:01:59,132 INFO L226 Difference]: Without dead ends: 2323 [2019-12-07 17:01:59,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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-12-07 17:01:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-12-07 17:01:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2323. [2019-12-07 17:01:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-12-07 17:01:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3106 transitions. [2019-12-07 17:01:59,180 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3106 transitions. Word has length 167 [2019-12-07 17:01:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:59,180 INFO L462 AbstractCegarLoop]: Abstraction has 2323 states and 3106 transitions. [2019-12-07 17:01:59,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:01:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3106 transitions. [2019-12-07 17:01:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 17:01:59,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:59,182 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-12-07 17:01:59,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 17:01:59,383 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:01:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1531587811, now seen corresponding path program 1 times [2019-12-07 17:01:59,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:01:59,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534663333] [2019-12-07 17:01:59,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:59,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 17:01:59,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:59,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-12-07 17:01:59,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,109 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 17:02:00,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,112 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_354|], 2=[|v_#memory_$Pointer$.base_348|, |v_#memory_$Pointer$.base_347|]} [2019-12-07 17:02:00,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-12-07 17:02:00,167 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-12-07 17:02:00,287 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-12-07 17:02:00,331 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,345 INFO L534 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-12-07 17:02:00,345 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 17:02:00,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,354 INFO L377 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 30 treesize of output 14 [2019-12-07 17:02:00,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,359 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:02:00,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,363 INFO L377 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 30 treesize of output 14 [2019-12-07 17:02:00,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,368 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:02:00,372 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:00,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,395 INFO L377 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 35 treesize of output 23 [2019-12-07 17:02:00,395 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,405 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,405 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 17:02:00,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,410 INFO L377 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 30 treesize of output 14 [2019-12-07 17:02:00,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,415 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:02:00,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,418 INFO L377 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 30 treesize of output 14 [2019-12-07 17:02:00,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:02:00,427 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:00,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,449 INFO L377 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 35 treesize of output 23 [2019-12-07 17:02:00,449 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,457 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 17:02:00,459 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_349|], 2=[|v_#memory_$Pointer$.base_361|]} [2019-12-07 17:02:00,461 INFO L377 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 49 treesize of output 37 [2019-12-07 17:02:00,462 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:00,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 17:02:00,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:00,503 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,520 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 17:02:00,520 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,520 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 17:02:00,523 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:00,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,550 INFO L377 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 35 treesize of output 23 [2019-12-07 17:02:00,551 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,558 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 17:02:00,561 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_350|], 2=[|v_#memory_$Pointer$.base_363|]} [2019-12-07 17:02:00,563 INFO L377 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 49 treesize of output 37 [2019-12-07 17:02:00,563 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:00,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:00,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 17:02:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:02:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:00,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:00,607 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 17:02:00,625 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 17:02:00,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:00,625 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 17:02:00,628 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_406|, |v_#memory_$Pointer$.offset_351|], 2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.base_364|, |v_#memory_$Pointer$.base_352|], 6=[|v_#memory_$Pointer$.offset_348|, |v_#memory_$Pointer$.base_353|]} [2019-12-07 17:02:00,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:00,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 17:02:00,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:01,349 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 17:02:01,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:01,389 INFO L377 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 19 treesize of output 1 [2019-12-07 17:02:01,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:01,710 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 17:02:01,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:01,717 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:02,247 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 17:02:02,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:02,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:02,336 INFO L377 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 30 treesize of output 14 [2019-12-07 17:02:02,337 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:02,551 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 17:02:02,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:02,558 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:02,802 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 17:02:02,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:02,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:02,808 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 106 [2019-12-07 17:02:02,808 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:02,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:02,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:19,097 WARN L192 SmtUtils]: Spent 16.22 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 17:02:19,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:19,097 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 166 [2019-12-07 17:02:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:02:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:02:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:19,100 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 5 xjuncts. [2019-12-07 17:02:19,210 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-12-07 17:02:19,210 INFO L614 ElimStorePlain]: treesize reduction 744, result has 11.3 percent of original size [2019-12-07 17:02:19,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:19,210 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:53 [2019-12-07 17:02:19,241 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_352|, |v_#memory_$Pointer$.base_365|], 12=[|v_#memory_int_407|]} [2019-12-07 17:02:19,244 INFO L377 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 53 treesize of output 41 [2019-12-07 17:02:19,244 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:19,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:19,268 INFO L377 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 51 treesize of output 33 [2019-12-07 17:02:19,269 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:19,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:19,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:02:19,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 37 [2019-12-07 17:02:19,294 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:19,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:19,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:19,307 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:41 [2019-12-07 17:02:19,355 INFO L377 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 37 treesize of output 13 [2019-12-07 17:02:19,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:19,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:19,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:02:19,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 17:02:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:02:19,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:02:19,567 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.base_367|, |v_#memory_$Pointer$.offset_354|, |v_#memory_$Pointer$.base_352|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_348|, |v_#memory_$Pointer$.base_353|]} [2019-12-07 17:02:19,620 INFO L377 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 20 treesize of output 1 [2019-12-07 17:02:19,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:02:19,943 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 17:02:19,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:19,960 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:20,245 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 17:02:20,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:20,256 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:20,372 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 17:02:20,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:20,377 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:20,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:20,430 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:02:20,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:20,468 INFO L377 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 1884 treesize of output 1716 [2019-12-07 17:02:20,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:02:20,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:02:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:02:20,471 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-12-07 17:02:20,797 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-07 17:02:20,798 INFO L614 ElimStorePlain]: treesize reduction 3160, result has 6.3 percent of original size [2019-12-07 17:02:28,979 WARN L192 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:02:28,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:28,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 92 [2019-12-07 17:02:28,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:02:28,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:28,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:28,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:29,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:02:29,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 52 [2019-12-07 17:02:29,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:02:29,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:02:29,029 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_83], 1=[v_arrayElimCell_84]} [2019-12-07 17:02:29,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534663333] [2019-12-07 17:02:29,032 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@126cc6ce [2019-12-07 17:02:29,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793956860] [2019-12-07 17:02:29,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:02:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:02:32,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 17:02:32,152 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@126cc6ce [2019-12-07 17:02:32,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036080653] [2019-12-07 17:02:32,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a24fce05-251f-40f5-8267-d8a2f790c2d0/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:02:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:02:32,418 INFO L264 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 17:02:32,419 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@126cc6ce [2019-12-07 17:02:32,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:02:32,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 17:02:32,419 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 17:02:32,419 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:02:33,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:02:33,069 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 17:02:33,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:02:33 BoogieIcfgContainer [2019-12-07 17:02:33,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:02:33,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:02:33,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:02:33,070 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:02:33,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:59" (3/4) ... [2019-12-07 17:02:33,073 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:02:33,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:02:33,073 INFO L168 Benchmark]: Toolchain (without parser) took 276255.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.0 MB in the beginning and 950.8 MB in the end (delta: -3.8 MB). Peak memory consumption was 167.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:33,074 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:02:33,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:33,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.79 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:33,074 INFO L168 Benchmark]: Boogie Preprocessor took 54.36 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:33,074 INFO L168 Benchmark]: RCFGBuilder took 1799.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:33,075 INFO L168 Benchmark]: TraceAbstraction took 273922.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 991.4 MB in the beginning and 950.8 MB in the end (delta: 40.6 MB). Peak memory consumption was 67.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:33,075 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.2 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:02:33,076 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.79 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.36 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1799.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 273922.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 991.4 MB in the beginning and 950.8 MB in the end (delta: 40.6 MB). Peak memory consumption was 67.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.2 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1723]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [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 [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) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 [L1371] s->state = 8528 [L1372] s->init_num = 0 [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) [L1418] s->state = 8544 [L1419] s->init_num = 0 [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) [L1539] COND FALSE !(blastFlag == 7) [L1723] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNKNOWN, OverallTime: 273.8s, OverallIterations: 38, TraceHistogramMax: 7, AutomataDifference: 214.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5984 SDtfs, 5817 SDslu, 13983 SDs, 0 SdLazy, 13216 SolverSat, 2094 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 203.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8686 GetRequests, 8487 SyntacticMatches, 8 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2323occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 3875 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 4349 NumberOfCodeBlocks, 4349 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8624 ConstructedInterpolants, 0 QuantifiedInterpolants, 2688235 SizeOfPredicates, 100 NumberOfNonLiveVariables, 10549 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 74 InterpolantComputations, 74 PerfectInterpolantSequences, 8530/8530 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...