./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.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_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 1e5c16342ed8a3195ac47e6b0aa4f5bd61af737f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 1e5c16342ed8a3195ac47e6b0aa4f5bd61af737f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:22:20,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:22:20,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:22:21,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:22:21,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:22:21,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:22:21,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:22:21,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:22:21,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:22:21,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:22:21,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:22:21,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:22:21,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:22:21,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:22:21,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:22:21,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:22:21,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:22:21,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:22:21,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:22:21,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:22:21,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:22:21,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:22:21,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:22:21,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:22:21,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:22:21,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:22:21,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:22:21,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:22:21,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:22:21,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:22:21,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:22:21,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:22:21,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:22:21,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:22:21,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:22:21,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:22:21,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:22:21,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:22:21,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:22:21,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:22:21,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:22:21,030 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:22:21,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:22:21,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:22:21,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:22:21,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:22:21,041 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:22:21,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:22:21,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:22:21,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:22:21,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:22:21,043 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:22:21,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:22:21,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:22:21,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:22:21,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:22:21,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:22:21,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:22:21,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:22:21,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:22:21,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:22:21,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:22:21,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:22:21,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:22:21,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:22:21,045 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_29713911-e023-4614-9be3-855ec32ff89b/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 -> 1e5c16342ed8a3195ac47e6b0aa4f5bd61af737f [2019-12-07 13:22:21,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:22:21,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:22:21,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:22:21,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:22:21,161 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:22:21,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.c [2019-12-07 13:22:21,204 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/860fcd09d/03d37bf4ca7f42b884fc0ca082242c79/FLAG182ba0cb4 [2019-12-07 13:22:21,698 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:22:21,699 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.c [2019-12-07 13:22:21,712 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/860fcd09d/03d37bf4ca7f42b884fc0ca082242c79/FLAG182ba0cb4 [2019-12-07 13:22:21,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/860fcd09d/03d37bf4ca7f42b884fc0ca082242c79 [2019-12-07 13:22:21,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:22:21,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:22:21,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:22:21,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:22:21,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:22:21,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:22:21" (1/1) ... [2019-12-07 13:22:21,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2474919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:21, skipping insertion in model container [2019-12-07 13:22:21,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:22:21" (1/1) ... [2019-12-07 13:22:21,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:22:21,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:22:22,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:22:22,048 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:22:22,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:22:22,130 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:22:22,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22 WrapperNode [2019-12-07 13:22:22,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:22:22,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:22:22,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:22:22,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:22:22,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:22:22,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:22:22,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:22:22,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:22:22,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... [2019-12-07 13:22:22,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:22:22,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:22:22,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:22:22,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:22:22,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:22:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:22:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:22:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:22:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:22:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:22:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:22:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:22:22,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:22:22,416 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:22:22,919 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 13:22:22,919 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 13:22:22,920 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:22:22,920 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:22:22,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:22 BoogieIcfgContainer [2019-12-07 13:22:22,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:22:22,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:22:22,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:22:22,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:22:22,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:22:21" (1/3) ... [2019-12-07 13:22:22,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432755e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:22:22, skipping insertion in model container [2019-12-07 13:22:22,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:22" (2/3) ... [2019-12-07 13:22:22,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432755e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:22:22, skipping insertion in model container [2019-12-07 13:22:22,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:22" (3/3) ... [2019-12-07 13:22:22,926 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2019-12-07 13:22:22,932 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:22:22,937 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:22:22,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:22:22,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:22:22,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:22:22,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:22:22,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:22:22,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:22:22,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:22:22,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:22:22,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:22:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-12-07 13:22:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:22:22,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:22,980 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, 1, 1] [2019-12-07 13:22:22,980 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889119, now seen corresponding path program 1 times [2019-12-07 13:22:22,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:22,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720557455] [2019-12-07 13:22:22,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:23,187 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 13:22:23,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720557455] [2019-12-07 13:22:23,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:23,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:23,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350651398] [2019-12-07 13:22:23,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:23,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:23,208 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2019-12-07 13:22:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:23,521 INFO L93 Difference]: Finished difference Result 345 states and 591 transitions. [2019-12-07 13:22:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:23,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 13:22:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:23,531 INFO L225 Difference]: With dead ends: 345 [2019-12-07 13:22:23,531 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 13:22:23,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 13:22:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 13:22:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-12-07 13:22:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-12-07 13:22:23,572 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 44 [2019-12-07 13:22:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:23,573 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-12-07 13:22:23,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-12-07 13:22:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:22:23,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:23,576 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, 1, 1] [2019-12-07 13:22:23,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash -829622597, now seen corresponding path program 1 times [2019-12-07 13:22:23,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:23,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26661095] [2019-12-07 13:22:23,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:23,665 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 13:22:23,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26661095] [2019-12-07 13:22:23,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:23,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:23,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455491399] [2019-12-07 13:22:23,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:23,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:23,669 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 4 states. [2019-12-07 13:22:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:23,911 INFO L93 Difference]: Finished difference Result 312 states and 487 transitions. [2019-12-07 13:22:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:23,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 13:22:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:23,913 INFO L225 Difference]: With dead ends: 312 [2019-12-07 13:22:23,913 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 13:22:23,915 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 13:22:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 13:22:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-12-07 13:22:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions. [2019-12-07 13:22:23,923 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 57 [2019-12-07 13:22:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:23,924 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 247 transitions. [2019-12-07 13:22:23,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions. [2019-12-07 13:22:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:22:23,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:23,926 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, 1, 1] [2019-12-07 13:22:23,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -44447127, now seen corresponding path program 1 times [2019-12-07 13:22:23,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:23,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027214471] [2019-12-07 13:22:23,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:23,988 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 13:22:23,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027214471] [2019-12-07 13:22:23,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:23,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:23,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579617461] [2019-12-07 13:22:23,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:23,990 INFO L87 Difference]: Start difference. First operand 157 states and 247 transitions. Second operand 4 states. [2019-12-07 13:22:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:24,198 INFO L93 Difference]: Finished difference Result 311 states and 485 transitions. [2019-12-07 13:22:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:24,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:22:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:24,201 INFO L225 Difference]: With dead ends: 311 [2019-12-07 13:22:24,201 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 13:22:24,202 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 13:22:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 13:22:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2019-12-07 13:22:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2019-12-07 13:22:24,211 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 58 [2019-12-07 13:22:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:24,212 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2019-12-07 13:22:24,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2019-12-07 13:22:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:22:24,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:24,214 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, 1, 1] [2019-12-07 13:22:24,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1118306, now seen corresponding path program 1 times [2019-12-07 13:22:24,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:24,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339993659] [2019-12-07 13:22:24,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:24,275 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 13:22:24,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339993659] [2019-12-07 13:22:24,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:24,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:24,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117068041] [2019-12-07 13:22:24,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:24,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:24,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:24,277 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand 4 states. [2019-12-07 13:22:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:24,472 INFO L93 Difference]: Finished difference Result 309 states and 482 transitions. [2019-12-07 13:22:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:24,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:22:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:24,474 INFO L225 Difference]: With dead ends: 309 [2019-12-07 13:22:24,474 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 13:22:24,474 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 13:22:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 13:22:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-12-07 13:22:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2019-12-07 13:22:24,480 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 58 [2019-12-07 13:22:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:24,480 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2019-12-07 13:22:24,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2019-12-07 13:22:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:22:24,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:24,481 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, 1] [2019-12-07 13:22:24,481 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1969168478, now seen corresponding path program 1 times [2019-12-07 13:22:24,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:24,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701311650] [2019-12-07 13:22:24,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:24,523 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 13:22:24,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701311650] [2019-12-07 13:22:24,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:24,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:24,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489665713] [2019-12-07 13:22:24,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:24,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:24,524 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand 4 states. [2019-12-07 13:22:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:24,718 INFO L93 Difference]: Finished difference Result 308 states and 480 transitions. [2019-12-07 13:22:24,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:24,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:22:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:24,719 INFO L225 Difference]: With dead ends: 308 [2019-12-07 13:22:24,719 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 13:22:24,720 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 13:22:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 13:22:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2019-12-07 13:22:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 244 transitions. [2019-12-07 13:22:24,725 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 244 transitions. Word has length 58 [2019-12-07 13:22:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:24,726 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 244 transitions. [2019-12-07 13:22:24,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 244 transitions. [2019-12-07 13:22:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:22:24,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:24,727 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, 1, 1] [2019-12-07 13:22:24,727 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1679982507, now seen corresponding path program 1 times [2019-12-07 13:22:24,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:24,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919705726] [2019-12-07 13:22:24,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:24,773 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 13:22:24,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919705726] [2019-12-07 13:22:24,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:24,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:24,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993511706] [2019-12-07 13:22:24,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:24,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:24,774 INFO L87 Difference]: Start difference. First operand 157 states and 244 transitions. Second operand 4 states. [2019-12-07 13:22:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:24,982 INFO L93 Difference]: Finished difference Result 308 states and 479 transitions. [2019-12-07 13:22:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:24,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:22:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:24,983 INFO L225 Difference]: With dead ends: 308 [2019-12-07 13:22:24,983 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 13:22:24,984 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 13:22:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 13:22:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2019-12-07 13:22:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2019-12-07 13:22:24,988 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 58 [2019-12-07 13:22:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:24,988 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2019-12-07 13:22:24,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2019-12-07 13:22:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:22:24,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:24,989 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, 1, 1] [2019-12-07 13:22:24,989 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash -666876654, now seen corresponding path program 1 times [2019-12-07 13:22:24,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:24,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187176482] [2019-12-07 13:22:24,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:25,032 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 13:22:25,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187176482] [2019-12-07 13:22:25,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:25,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:25,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138249668] [2019-12-07 13:22:25,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:25,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:25,033 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand 4 states. [2019-12-07 13:22:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:25,247 INFO L93 Difference]: Finished difference Result 308 states and 478 transitions. [2019-12-07 13:22:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:25,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 13:22:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:25,249 INFO L225 Difference]: With dead ends: 308 [2019-12-07 13:22:25,249 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 13:22:25,250 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 13:22:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 13:22:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2019-12-07 13:22:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2019-12-07 13:22:25,254 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 59 [2019-12-07 13:22:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:25,255 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2019-12-07 13:22:25,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2019-12-07 13:22:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:22:25,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:25,256 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, 1, 1] [2019-12-07 13:22:25,256 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1227571536, now seen corresponding path program 1 times [2019-12-07 13:22:25,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:25,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237526445] [2019-12-07 13:22:25,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:25,298 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 13:22:25,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237526445] [2019-12-07 13:22:25,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:25,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:25,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843038838] [2019-12-07 13:22:25,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:25,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:25,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:25,299 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand 4 states. [2019-12-07 13:22:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:25,500 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2019-12-07 13:22:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:25,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 13:22:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:25,501 INFO L225 Difference]: With dead ends: 308 [2019-12-07 13:22:25,501 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 13:22:25,501 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 13:22:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 13:22:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2019-12-07 13:22:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2019-12-07 13:22:25,505 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 60 [2019-12-07 13:22:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:25,505 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2019-12-07 13:22:25,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2019-12-07 13:22:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:22:25,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:25,506 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, 1, 1] [2019-12-07 13:22:25,506 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash 378861101, now seen corresponding path program 1 times [2019-12-07 13:22:25,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:25,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145480309] [2019-12-07 13:22:25,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:25,535 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 13:22:25,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145480309] [2019-12-07 13:22:25,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:25,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:25,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076204238] [2019-12-07 13:22:25,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:25,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:25,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:25,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:25,537 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand 4 states. [2019-12-07 13:22:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:25,694 INFO L93 Difference]: Finished difference Result 298 states and 463 transitions. [2019-12-07 13:22:25,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:25,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 13:22:25,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:25,695 INFO L225 Difference]: With dead ends: 298 [2019-12-07 13:22:25,695 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 13:22:25,695 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 13:22:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 13:22:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-12-07 13:22:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:22:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2019-12-07 13:22:25,699 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 61 [2019-12-07 13:22:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:25,699 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2019-12-07 13:22:25,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2019-12-07 13:22:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:22:25,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:25,700 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, 1, 1] [2019-12-07 13:22:25,700 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1409346107, now seen corresponding path program 1 times [2019-12-07 13:22:25,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:25,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596892269] [2019-12-07 13:22:25,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:25,730 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 13:22:25,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596892269] [2019-12-07 13:22:25,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:25,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:25,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54563502] [2019-12-07 13:22:25,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:25,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:25,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:25,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:25,732 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 4 states. [2019-12-07 13:22:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:25,960 INFO L93 Difference]: Finished difference Result 338 states and 524 transitions. [2019-12-07 13:22:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:25,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 13:22:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:25,963 INFO L225 Difference]: With dead ends: 338 [2019-12-07 13:22:25,963 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 13:22:25,963 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 13:22:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 13:22:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2019-12-07 13:22:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-12-07 13:22:25,969 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 61 [2019-12-07 13:22:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:25,969 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-12-07 13:22:25,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-12-07 13:22:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:22:25,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:25,970 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, 1, 1] [2019-12-07 13:22:25,970 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash -550111145, now seen corresponding path program 1 times [2019-12-07 13:22:25,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:25,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742960157] [2019-12-07 13:22:25,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:26,009 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 13:22:26,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742960157] [2019-12-07 13:22:26,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:26,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:26,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573017957] [2019-12-07 13:22:26,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:26,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:26,010 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 4 states. [2019-12-07 13:22:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:26,239 INFO L93 Difference]: Finished difference Result 360 states and 561 transitions. [2019-12-07 13:22:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:26,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:22:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:26,241 INFO L225 Difference]: With dead ends: 360 [2019-12-07 13:22:26,241 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 13:22:26,242 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 13:22:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 13:22:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2019-12-07 13:22:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2019-12-07 13:22:26,247 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 74 [2019-12-07 13:22:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:26,247 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2019-12-07 13:22:26,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2019-12-07 13:22:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 13:22:26,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:26,248 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, 1, 1] [2019-12-07 13:22:26,248 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash 30473293, now seen corresponding path program 1 times [2019-12-07 13:22:26,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:26,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596596424] [2019-12-07 13:22:26,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:26,283 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 13:22:26,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596596424] [2019-12-07 13:22:26,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:26,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:26,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627731455] [2019-12-07 13:22:26,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:26,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:26,284 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand 4 states. [2019-12-07 13:22:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:26,536 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2019-12-07 13:22:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:26,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 13:22:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:26,537 INFO L225 Difference]: With dead ends: 359 [2019-12-07 13:22:26,538 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 13:22:26,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 13:22:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 13:22:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2019-12-07 13:22:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2019-12-07 13:22:26,542 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 75 [2019-12-07 13:22:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:26,542 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2019-12-07 13:22:26,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2019-12-07 13:22:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 13:22:26,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:26,543 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, 1, 1] [2019-12-07 13:22:26,543 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 73802114, now seen corresponding path program 1 times [2019-12-07 13:22:26,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:26,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074115853] [2019-12-07 13:22:26,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:26,574 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 13:22:26,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074115853] [2019-12-07 13:22:26,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:26,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:26,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293596808] [2019-12-07 13:22:26,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:26,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:26,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:26,576 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand 4 states. [2019-12-07 13:22:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:26,807 INFO L93 Difference]: Finished difference Result 357 states and 554 transitions. [2019-12-07 13:22:26,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:26,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 13:22:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:26,808 INFO L225 Difference]: With dead ends: 357 [2019-12-07 13:22:26,808 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 13:22:26,809 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 13:22:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 13:22:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2019-12-07 13:22:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 275 transitions. [2019-12-07 13:22:26,812 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 275 transitions. Word has length 75 [2019-12-07 13:22:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:26,812 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 275 transitions. [2019-12-07 13:22:26,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 275 transitions. [2019-12-07 13:22:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 13:22:26,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:26,813 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, 1, 1] [2019-12-07 13:22:26,813 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2044088898, now seen corresponding path program 1 times [2019-12-07 13:22:26,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:26,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109785444] [2019-12-07 13:22:26,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:26,848 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 13:22:26,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109785444] [2019-12-07 13:22:26,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:26,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:26,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546755670] [2019-12-07 13:22:26,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:26,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:26,850 INFO L87 Difference]: Start difference. First operand 179 states and 275 transitions. Second operand 4 states. [2019-12-07 13:22:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:27,071 INFO L93 Difference]: Finished difference Result 356 states and 551 transitions. [2019-12-07 13:22:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:27,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 13:22:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:27,072 INFO L225 Difference]: With dead ends: 356 [2019-12-07 13:22:27,072 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:22:27,073 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 13:22:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:22:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2019-12-07 13:22:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 274 transitions. [2019-12-07 13:22:27,076 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 274 transitions. Word has length 75 [2019-12-07 13:22:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:27,076 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 274 transitions. [2019-12-07 13:22:27,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 274 transitions. [2019-12-07 13:22:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 13:22:27,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:27,077 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, 1, 1] [2019-12-07 13:22:27,077 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1605062087, now seen corresponding path program 1 times [2019-12-07 13:22:27,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:27,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855336297] [2019-12-07 13:22:27,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:27,103 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 13:22:27,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855336297] [2019-12-07 13:22:27,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:27,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:27,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248817441] [2019-12-07 13:22:27,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:27,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:27,104 INFO L87 Difference]: Start difference. First operand 179 states and 274 transitions. Second operand 4 states. [2019-12-07 13:22:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:27,307 INFO L93 Difference]: Finished difference Result 356 states and 549 transitions. [2019-12-07 13:22:27,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:27,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 13:22:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:27,309 INFO L225 Difference]: With dead ends: 356 [2019-12-07 13:22:27,309 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:22:27,309 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 13:22:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:22:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2019-12-07 13:22:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 273 transitions. [2019-12-07 13:22:27,313 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 273 transitions. Word has length 75 [2019-12-07 13:22:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:27,314 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 273 transitions. [2019-12-07 13:22:27,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 273 transitions. [2019-12-07 13:22:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 13:22:27,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:27,314 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, 1, 1] [2019-12-07 13:22:27,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1655656366, now seen corresponding path program 1 times [2019-12-07 13:22:27,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:27,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769924957] [2019-12-07 13:22:27,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:27,341 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 13:22:27,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769924957] [2019-12-07 13:22:27,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:27,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:27,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533441612] [2019-12-07 13:22:27,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:27,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:27,343 INFO L87 Difference]: Start difference. First operand 179 states and 273 transitions. Second operand 4 states. [2019-12-07 13:22:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:27,542 INFO L93 Difference]: Finished difference Result 356 states and 547 transitions. [2019-12-07 13:22:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:27,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 13:22:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:27,544 INFO L225 Difference]: With dead ends: 356 [2019-12-07 13:22:27,544 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:22:27,544 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 13:22:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:22:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2019-12-07 13:22:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2019-12-07 13:22:27,548 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 76 [2019-12-07 13:22:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:27,548 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2019-12-07 13:22:27,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2019-12-07 13:22:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 13:22:27,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:27,549 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, 1, 1] [2019-12-07 13:22:27,549 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 211651124, now seen corresponding path program 1 times [2019-12-07 13:22:27,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:27,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127180121] [2019-12-07 13:22:27,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:27,585 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 13:22:27,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127180121] [2019-12-07 13:22:27,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:27,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:27,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187959102] [2019-12-07 13:22:27,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:27,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:27,586 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand 4 states. [2019-12-07 13:22:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:27,831 INFO L93 Difference]: Finished difference Result 356 states and 545 transitions. [2019-12-07 13:22:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:27,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 13:22:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:27,833 INFO L225 Difference]: With dead ends: 356 [2019-12-07 13:22:27,833 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:22:27,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 13:22:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:22:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2019-12-07 13:22:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 271 transitions. [2019-12-07 13:22:27,838 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 271 transitions. Word has length 77 [2019-12-07 13:22:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:27,838 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 271 transitions. [2019-12-07 13:22:27,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 271 transitions. [2019-12-07 13:22:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 13:22:27,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:27,839 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, 1, 1] [2019-12-07 13:22:27,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1049900599, now seen corresponding path program 1 times [2019-12-07 13:22:27,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:27,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963031615] [2019-12-07 13:22:27,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:27,876 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 13:22:27,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963031615] [2019-12-07 13:22:27,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:27,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:27,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099551611] [2019-12-07 13:22:27,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:27,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:27,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:27,878 INFO L87 Difference]: Start difference. First operand 179 states and 271 transitions. Second operand 4 states. [2019-12-07 13:22:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:28,059 INFO L93 Difference]: Finished difference Result 346 states and 530 transitions. [2019-12-07 13:22:28,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:28,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 13:22:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:28,060 INFO L225 Difference]: With dead ends: 346 [2019-12-07 13:22:28,060 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:22:28,061 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 13:22:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:22:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2019-12-07 13:22:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:22:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 270 transitions. [2019-12-07 13:22:28,063 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 270 transitions. Word has length 78 [2019-12-07 13:22:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:28,064 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 270 transitions. [2019-12-07 13:22:28,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 270 transitions. [2019-12-07 13:22:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 13:22:28,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:28,065 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, 1] [2019-12-07 13:22:28,065 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash -614883725, now seen corresponding path program 1 times [2019-12-07 13:22:28,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:28,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071331916] [2019-12-07 13:22:28,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:28,114 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 13:22:28,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071331916] [2019-12-07 13:22:28,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:28,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:28,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016065804] [2019-12-07 13:22:28,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:28,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:28,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:28,115 INFO L87 Difference]: Start difference. First operand 179 states and 270 transitions. Second operand 4 states. [2019-12-07 13:22:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:28,443 INFO L93 Difference]: Finished difference Result 454 states and 699 transitions. [2019-12-07 13:22:28,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:28,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 13:22:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:28,445 INFO L225 Difference]: With dead ends: 454 [2019-12-07 13:22:28,445 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 13:22:28,445 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 13:22:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 13:22:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2019-12-07 13:22:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-07 13:22:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 344 transitions. [2019-12-07 13:22:28,450 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 344 transitions. Word has length 83 [2019-12-07 13:22:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:28,450 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 344 transitions. [2019-12-07 13:22:28,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 344 transitions. [2019-12-07 13:22:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 13:22:28,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:28,451 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, 1] [2019-12-07 13:22:28,451 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash -366737231, now seen corresponding path program 1 times [2019-12-07 13:22:28,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:28,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75952660] [2019-12-07 13:22:28,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:28,505 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 13:22:28,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75952660] [2019-12-07 13:22:28,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:28,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:28,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313137474] [2019-12-07 13:22:28,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:28,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:28,506 INFO L87 Difference]: Start difference. First operand 220 states and 344 transitions. Second operand 4 states. [2019-12-07 13:22:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:28,782 INFO L93 Difference]: Finished difference Result 471 states and 743 transitions. [2019-12-07 13:22:28,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:28,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 13:22:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:28,784 INFO L225 Difference]: With dead ends: 471 [2019-12-07 13:22:28,784 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 13:22:28,784 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 13:22:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 13:22:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2019-12-07 13:22:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-07 13:22:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 386 transitions. [2019-12-07 13:22:28,788 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 386 transitions. Word has length 83 [2019-12-07 13:22:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:28,788 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 386 transitions. [2019-12-07 13:22:28,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 386 transitions. [2019-12-07 13:22:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 13:22:28,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:28,789 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, 1, 1] [2019-12-07 13:22:28,789 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1739674319, now seen corresponding path program 1 times [2019-12-07 13:22:28,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:28,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778235045] [2019-12-07 13:22:28,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:28,828 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 13:22:28,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778235045] [2019-12-07 13:22:28,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:28,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:28,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67380477] [2019-12-07 13:22:28,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:28,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:28,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:28,829 INFO L87 Difference]: Start difference. First operand 244 states and 386 transitions. Second operand 4 states. [2019-12-07 13:22:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:29,117 INFO L93 Difference]: Finished difference Result 534 states and 843 transitions. [2019-12-07 13:22:29,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:29,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 13:22:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:29,118 INFO L225 Difference]: With dead ends: 534 [2019-12-07 13:22:29,118 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 13:22:29,119 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 13:22:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 13:22:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2019-12-07 13:22:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 13:22:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 387 transitions. [2019-12-07 13:22:29,123 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 387 transitions. Word has length 84 [2019-12-07 13:22:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:29,123 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 387 transitions. [2019-12-07 13:22:29,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 387 transitions. [2019-12-07 13:22:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:22:29,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:29,123 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, 1, 1] [2019-12-07 13:22:29,124 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1240955497, now seen corresponding path program 1 times [2019-12-07 13:22:29,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:29,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92654537] [2019-12-07 13:22:29,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:29,158 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 13:22:29,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92654537] [2019-12-07 13:22:29,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:29,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:29,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888628756] [2019-12-07 13:22:29,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:29,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:29,160 INFO L87 Difference]: Start difference. First operand 245 states and 387 transitions. Second operand 4 states. [2019-12-07 13:22:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:29,454 INFO L93 Difference]: Finished difference Result 535 states and 843 transitions. [2019-12-07 13:22:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:29,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:22:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:29,455 INFO L225 Difference]: With dead ends: 535 [2019-12-07 13:22:29,455 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 13:22:29,456 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 13:22:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 13:22:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2019-12-07 13:22:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 13:22:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 386 transitions. [2019-12-07 13:22:29,460 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 386 transitions. Word has length 96 [2019-12-07 13:22:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:29,460 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 386 transitions. [2019-12-07 13:22:29,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 386 transitions. [2019-12-07 13:22:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:22:29,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:29,462 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, 1, 1] [2019-12-07 13:22:29,462 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1667226389, now seen corresponding path program 1 times [2019-12-07 13:22:29,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:29,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231789275] [2019-12-07 13:22:29,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:29,505 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 13:22:29,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231789275] [2019-12-07 13:22:29,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:29,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:29,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723494002] [2019-12-07 13:22:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:29,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:29,507 INFO L87 Difference]: Start difference. First operand 245 states and 386 transitions. Second operand 4 states. [2019-12-07 13:22:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:29,823 INFO L93 Difference]: Finished difference Result 497 states and 784 transitions. [2019-12-07 13:22:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:29,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:22:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:29,827 INFO L225 Difference]: With dead ends: 497 [2019-12-07 13:22:29,827 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 13:22:29,828 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 13:22:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 13:22:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2019-12-07 13:22:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 13:22:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 385 transitions. [2019-12-07 13:22:29,835 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 385 transitions. Word has length 96 [2019-12-07 13:22:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:29,835 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 385 transitions. [2019-12-07 13:22:29,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 385 transitions. [2019-12-07 13:22:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:22:29,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:29,837 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, 1, 1] [2019-12-07 13:22:29,837 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash -281035653, now seen corresponding path program 1 times [2019-12-07 13:22:29,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:29,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016972319] [2019-12-07 13:22:29,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:29,876 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 13:22:29,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016972319] [2019-12-07 13:22:29,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:29,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:29,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354052955] [2019-12-07 13:22:29,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:29,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:29,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:29,877 INFO L87 Difference]: Start difference. First operand 245 states and 385 transitions. Second operand 4 states. [2019-12-07 13:22:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:30,235 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2019-12-07 13:22:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:30,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:22:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:30,237 INFO L225 Difference]: With dead ends: 534 [2019-12-07 13:22:30,237 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 13:22:30,237 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 13:22:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 13:22:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 245. [2019-12-07 13:22:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 13:22:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 384 transitions. [2019-12-07 13:22:30,242 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 384 transitions. Word has length 97 [2019-12-07 13:22:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:30,242 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 384 transitions. [2019-12-07 13:22:30,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 384 transitions. [2019-12-07 13:22:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:22:30,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:30,243 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, 1, 1] [2019-12-07 13:22:30,243 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash -237706832, now seen corresponding path program 1 times [2019-12-07 13:22:30,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:30,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773524638] [2019-12-07 13:22:30,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:30,285 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 13:22:30,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773524638] [2019-12-07 13:22:30,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:30,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:30,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203833796] [2019-12-07 13:22:30,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:30,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:30,287 INFO L87 Difference]: Start difference. First operand 245 states and 384 transitions. Second operand 4 states. [2019-12-07 13:22:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:30,585 INFO L93 Difference]: Finished difference Result 532 states and 834 transitions. [2019-12-07 13:22:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:30,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:22:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:30,586 INFO L225 Difference]: With dead ends: 532 [2019-12-07 13:22:30,586 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 13:22:30,587 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 13:22:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 13:22:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 245. [2019-12-07 13:22:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 13:22:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 383 transitions. [2019-12-07 13:22:30,590 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 383 transitions. Word has length 97 [2019-12-07 13:22:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:30,590 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 383 transitions. [2019-12-07 13:22:30,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 383 transitions. [2019-12-07 13:22:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:22:30,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:30,591 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, 1, 1] [2019-12-07 13:22:30,591 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:30,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1732579952, now seen corresponding path program 1 times [2019-12-07 13:22:30,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:30,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856079057] [2019-12-07 13:22:30,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:30,623 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 13:22:30,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856079057] [2019-12-07 13:22:30,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:30,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:30,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772782726] [2019-12-07 13:22:30,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:30,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:30,624 INFO L87 Difference]: Start difference. First operand 245 states and 383 transitions. Second operand 4 states. [2019-12-07 13:22:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:30,900 INFO L93 Difference]: Finished difference Result 531 states and 831 transitions. [2019-12-07 13:22:30,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:30,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:22:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:30,902 INFO L225 Difference]: With dead ends: 531 [2019-12-07 13:22:30,902 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 13:22:30,902 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 13:22:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 13:22:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 245. [2019-12-07 13:22:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 13:22:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2019-12-07 13:22:30,907 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 97 [2019-12-07 13:22:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:30,907 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2019-12-07 13:22:30,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2019-12-07 13:22:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:22:30,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:30,908 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, 1] [2019-12-07 13:22:30,908 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:30,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:30,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1916571033, now seen corresponding path program 1 times [2019-12-07 13:22:30,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:30,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278110395] [2019-12-07 13:22:30,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:30,957 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 13:22:30,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278110395] [2019-12-07 13:22:30,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:30,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:22:30,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938780193] [2019-12-07 13:22:30,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:22:30,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:22:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:22:30,958 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand 5 states. [2019-12-07 13:22:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:31,267 INFO L93 Difference]: Finished difference Result 492 states and 772 transitions. [2019-12-07 13:22:31,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:22:31,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-07 13:22:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:31,269 INFO L225 Difference]: With dead ends: 492 [2019-12-07 13:22:31,269 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 13:22:31,269 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 13:22:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 13:22:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-12-07 13:22:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 408 transitions. [2019-12-07 13:22:31,274 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 408 transitions. Word has length 97 [2019-12-07 13:22:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:31,274 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 408 transitions. [2019-12-07 13:22:31,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:22:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 408 transitions. [2019-12-07 13:22:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:22:31,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:31,275 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, 1, 1] [2019-12-07 13:22:31,275 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash -197032082, now seen corresponding path program 1 times [2019-12-07 13:22:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:31,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681199482] [2019-12-07 13:22:31,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:31,315 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 13:22:31,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681199482] [2019-12-07 13:22:31,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:31,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:31,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234133205] [2019-12-07 13:22:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:31,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:31,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:31,316 INFO L87 Difference]: Start difference. First operand 265 states and 408 transitions. Second operand 4 states. [2019-12-07 13:22:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:31,548 INFO L93 Difference]: Finished difference Result 534 states and 824 transitions. [2019-12-07 13:22:31,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:31,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:22:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:31,549 INFO L225 Difference]: With dead ends: 534 [2019-12-07 13:22:31,549 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 13:22:31,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 13:22:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 13:22:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 265. [2019-12-07 13:22:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2019-12-07 13:22:31,554 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 97 [2019-12-07 13:22:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:31,554 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2019-12-07 13:22:31,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2019-12-07 13:22:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:22:31,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:31,555 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, 1, 1] [2019-12-07 13:22:31,555 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1773254702, now seen corresponding path program 1 times [2019-12-07 13:22:31,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:31,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304340599] [2019-12-07 13:22:31,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:31,589 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 13:22:31,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304340599] [2019-12-07 13:22:31,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:31,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:31,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470212200] [2019-12-07 13:22:31,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:31,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:31,590 INFO L87 Difference]: Start difference. First operand 265 states and 407 transitions. Second operand 4 states. [2019-12-07 13:22:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:31,819 INFO L93 Difference]: Finished difference Result 533 states and 821 transitions. [2019-12-07 13:22:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:31,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:22:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:31,821 INFO L225 Difference]: With dead ends: 533 [2019-12-07 13:22:31,821 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 13:22:31,821 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 13:22:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 13:22:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-12-07 13:22:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2019-12-07 13:22:31,827 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 97 [2019-12-07 13:22:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:31,827 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2019-12-07 13:22:31,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2019-12-07 13:22:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:22:31,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:31,828 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, 1, 1] [2019-12-07 13:22:31,828 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:31,829 INFO L82 PathProgramCache]: Analyzing trace with hash -352879123, now seen corresponding path program 1 times [2019-12-07 13:22:31,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:31,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422875292] [2019-12-07 13:22:31,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:31,864 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 13:22:31,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422875292] [2019-12-07 13:22:31,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:31,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:31,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799118759] [2019-12-07 13:22:31,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:31,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:31,865 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand 4 states. [2019-12-07 13:22:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:32,151 INFO L93 Difference]: Finished difference Result 571 states and 876 transitions. [2019-12-07 13:22:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:32,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 13:22:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:32,160 INFO L225 Difference]: With dead ends: 571 [2019-12-07 13:22:32,160 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 13:22:32,161 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 13:22:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 13:22:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2019-12-07 13:22:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2019-12-07 13:22:32,165 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 98 [2019-12-07 13:22:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:32,165 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2019-12-07 13:22:32,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2019-12-07 13:22:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:22:32,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:32,166 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, 1, 1] [2019-12-07 13:22:32,166 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 908038127, now seen corresponding path program 1 times [2019-12-07 13:22:32,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:32,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154673108] [2019-12-07 13:22:32,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:32,196 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 13:22:32,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154673108] [2019-12-07 13:22:32,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:32,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:32,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766147123] [2019-12-07 13:22:32,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:32,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:32,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:32,198 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand 4 states. [2019-12-07 13:22:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:32,420 INFO L93 Difference]: Finished difference Result 533 states and 817 transitions. [2019-12-07 13:22:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:32,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 13:22:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:32,421 INFO L225 Difference]: With dead ends: 533 [2019-12-07 13:22:32,422 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 13:22:32,422 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 13:22:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 13:22:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-12-07 13:22:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2019-12-07 13:22:32,426 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 98 [2019-12-07 13:22:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:32,426 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2019-12-07 13:22:32,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2019-12-07 13:22:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 13:22:32,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:32,427 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, 1, 1] [2019-12-07 13:22:32,427 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 4634164, now seen corresponding path program 1 times [2019-12-07 13:22:32,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:32,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081060047] [2019-12-07 13:22:32,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:32,462 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 13:22:32,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081060047] [2019-12-07 13:22:32,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:32,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:32,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191390115] [2019-12-07 13:22:32,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:32,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:32,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:32,463 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2019-12-07 13:22:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:32,729 INFO L93 Difference]: Finished difference Result 571 states and 872 transitions. [2019-12-07 13:22:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:32,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 13:22:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:32,731 INFO L225 Difference]: With dead ends: 571 [2019-12-07 13:22:32,731 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 13:22:32,731 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 13:22:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 13:22:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2019-12-07 13:22:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2019-12-07 13:22:32,736 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 99 [2019-12-07 13:22:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:32,736 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2019-12-07 13:22:32,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2019-12-07 13:22:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 13:22:32,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:32,737 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, 1, 1] [2019-12-07 13:22:32,737 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 438363250, now seen corresponding path program 1 times [2019-12-07 13:22:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:32,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474410975] [2019-12-07 13:22:32,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:32,767 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 13:22:32,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474410975] [2019-12-07 13:22:32,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:32,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:32,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362814565] [2019-12-07 13:22:32,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:32,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:32,768 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 4 states. [2019-12-07 13:22:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:32,982 INFO L93 Difference]: Finished difference Result 533 states and 813 transitions. [2019-12-07 13:22:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:32,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 13:22:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:32,984 INFO L225 Difference]: With dead ends: 533 [2019-12-07 13:22:32,984 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 13:22:32,984 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 13:22:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 13:22:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-12-07 13:22:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2019-12-07 13:22:32,988 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 99 [2019-12-07 13:22:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:32,989 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2019-12-07 13:22:32,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2019-12-07 13:22:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:22:32,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:32,989 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, 1, 1] [2019-12-07 13:22:32,990 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1836152622, now seen corresponding path program 1 times [2019-12-07 13:22:32,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:32,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283831544] [2019-12-07 13:22:32,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:33,021 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 13:22:33,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283831544] [2019-12-07 13:22:33,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:33,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:33,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632271209] [2019-12-07 13:22:33,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:33,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:33,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:33,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:33,022 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 4 states. [2019-12-07 13:22:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:33,326 INFO L93 Difference]: Finished difference Result 571 states and 868 transitions. [2019-12-07 13:22:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:33,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 13:22:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:33,328 INFO L225 Difference]: With dead ends: 571 [2019-12-07 13:22:33,328 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 13:22:33,328 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 13:22:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 13:22:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2019-12-07 13:22:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2019-12-07 13:22:33,332 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 100 [2019-12-07 13:22:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:33,332 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2019-12-07 13:22:33,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2019-12-07 13:22:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:22:33,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:33,333 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, 1, 1] [2019-12-07 13:22:33,333 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1275452844, now seen corresponding path program 1 times [2019-12-07 13:22:33,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:33,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782336519] [2019-12-07 13:22:33,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:33,365 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 13:22:33,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782336519] [2019-12-07 13:22:33,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:33,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:33,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890424282] [2019-12-07 13:22:33,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:33,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:33,366 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 4 states. [2019-12-07 13:22:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:33,588 INFO L93 Difference]: Finished difference Result 533 states and 809 transitions. [2019-12-07 13:22:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:33,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 13:22:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:33,590 INFO L225 Difference]: With dead ends: 533 [2019-12-07 13:22:33,590 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 13:22:33,590 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 13:22:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 13:22:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-12-07 13:22:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2019-12-07 13:22:33,594 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 100 [2019-12-07 13:22:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:33,594 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2019-12-07 13:22:33,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2019-12-07 13:22:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 13:22:33,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:33,595 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, 1, 1] [2019-12-07 13:22:33,595 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1190202361, now seen corresponding path program 1 times [2019-12-07 13:22:33,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:33,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665073066] [2019-12-07 13:22:33,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:33,625 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 13:22:33,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665073066] [2019-12-07 13:22:33,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:33,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:33,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659809968] [2019-12-07 13:22:33,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:33,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:33,626 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 4 states. [2019-12-07 13:22:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:33,890 INFO L93 Difference]: Finished difference Result 561 states and 852 transitions. [2019-12-07 13:22:33,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:33,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 13:22:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:33,892 INFO L225 Difference]: With dead ends: 561 [2019-12-07 13:22:33,892 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 13:22:33,892 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 13:22:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 13:22:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 265. [2019-12-07 13:22:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2019-12-07 13:22:33,897 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 101 [2019-12-07 13:22:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:33,898 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2019-12-07 13:22:33,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2019-12-07 13:22:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 13:22:33,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:33,899 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, 1, 1] [2019-12-07 13:22:33,899 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1392026295, now seen corresponding path program 1 times [2019-12-07 13:22:33,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:33,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2592283] [2019-12-07 13:22:33,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:33,945 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 13:22:33,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2592283] [2019-12-07 13:22:33,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:33,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:33,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461457536] [2019-12-07 13:22:33,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:33,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:33,946 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 4 states. [2019-12-07 13:22:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:34,261 INFO L93 Difference]: Finished difference Result 523 states and 793 transitions. [2019-12-07 13:22:34,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:34,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 13:22:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:34,264 INFO L225 Difference]: With dead ends: 523 [2019-12-07 13:22:34,264 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 13:22:34,264 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 13:22:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 13:22:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2019-12-07 13:22:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2019-12-07 13:22:34,270 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 101 [2019-12-07 13:22:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:34,271 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2019-12-07 13:22:34,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2019-12-07 13:22:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 13:22:34,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:34,272 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, 1, 1] [2019-12-07 13:22:34,272 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1404579251, now seen corresponding path program 1 times [2019-12-07 13:22:34,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:34,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021985996] [2019-12-07 13:22:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:34,312 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 13:22:34,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021985996] [2019-12-07 13:22:34,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:34,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:34,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26113435] [2019-12-07 13:22:34,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:34,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:34,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:34,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:34,313 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand 4 states. [2019-12-07 13:22:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:34,580 INFO L93 Difference]: Finished difference Result 561 states and 848 transitions. [2019-12-07 13:22:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:34,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 13:22:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:34,582 INFO L225 Difference]: With dead ends: 561 [2019-12-07 13:22:34,582 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 13:22:34,582 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 13:22:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 13:22:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 265. [2019-12-07 13:22:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:22:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2019-12-07 13:22:34,588 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 105 [2019-12-07 13:22:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:34,588 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2019-12-07 13:22:34,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2019-12-07 13:22:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 13:22:34,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:34,589 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, 1, 1] [2019-12-07 13:22:34,589 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1350186353, now seen corresponding path program 1 times [2019-12-07 13:22:34,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:34,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712416706] [2019-12-07 13:22:34,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:34,626 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 13:22:34,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712416706] [2019-12-07 13:22:34,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:34,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:34,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895653997] [2019-12-07 13:22:34,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:34,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:34,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:34,627 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 4 states. [2019-12-07 13:22:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:34,871 INFO L93 Difference]: Finished difference Result 564 states and 853 transitions. [2019-12-07 13:22:34,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:34,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 13:22:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:34,873 INFO L225 Difference]: With dead ends: 564 [2019-12-07 13:22:34,873 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 13:22:34,873 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 13:22:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 13:22:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-12-07 13:22:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2019-12-07 13:22:34,877 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 105 [2019-12-07 13:22:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:34,877 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2019-12-07 13:22:34,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2019-12-07 13:22:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 13:22:34,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:34,878 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, 1, 1] [2019-12-07 13:22:34,878 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2023363820, now seen corresponding path program 1 times [2019-12-07 13:22:34,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:34,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944942440] [2019-12-07 13:22:34,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:34,921 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 13:22:34,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944942440] [2019-12-07 13:22:34,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:34,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:34,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661512870] [2019-12-07 13:22:34,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:34,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:34,922 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 4 states. [2019-12-07 13:22:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:35,200 INFO L93 Difference]: Finished difference Result 613 states and 936 transitions. [2019-12-07 13:22:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:35,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 13:22:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:35,201 INFO L225 Difference]: With dead ends: 613 [2019-12-07 13:22:35,202 INFO L226 Difference]: Without dead ends: 341 [2019-12-07 13:22:35,202 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 13:22:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-07 13:22:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 291. [2019-12-07 13:22:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2019-12-07 13:22:35,206 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 108 [2019-12-07 13:22:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:35,206 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2019-12-07 13:22:35,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2019-12-07 13:22:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 13:22:35,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:35,207 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, 1, 1] [2019-12-07 13:22:35,207 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1505475213, now seen corresponding path program 1 times [2019-12-07 13:22:35,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:35,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589053822] [2019-12-07 13:22:35,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:35,245 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 13:22:35,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589053822] [2019-12-07 13:22:35,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:35,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:35,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802124756] [2019-12-07 13:22:35,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:35,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:35,246 INFO L87 Difference]: Start difference. First operand 291 states and 441 transitions. Second operand 4 states. [2019-12-07 13:22:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:35,486 INFO L93 Difference]: Finished difference Result 605 states and 921 transitions. [2019-12-07 13:22:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:35,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 13:22:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:35,488 INFO L225 Difference]: With dead ends: 605 [2019-12-07 13:22:35,488 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 13:22:35,488 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 13:22:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 13:22:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2019-12-07 13:22:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 440 transitions. [2019-12-07 13:22:35,492 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 440 transitions. Word has length 109 [2019-12-07 13:22:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:35,493 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 440 transitions. [2019-12-07 13:22:35,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 440 transitions. [2019-12-07 13:22:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 13:22:35,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:35,493 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, 1, 1] [2019-12-07 13:22:35,494 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1509096972, now seen corresponding path program 1 times [2019-12-07 13:22:35,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:35,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536475330] [2019-12-07 13:22:35,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:35,533 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 13:22:35,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536475330] [2019-12-07 13:22:35,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:35,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:35,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833069721] [2019-12-07 13:22:35,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:35,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:35,534 INFO L87 Difference]: Start difference. First operand 291 states and 440 transitions. Second operand 4 states. [2019-12-07 13:22:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:35,790 INFO L93 Difference]: Finished difference Result 605 states and 919 transitions. [2019-12-07 13:22:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:35,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 13:22:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:35,792 INFO L225 Difference]: With dead ends: 605 [2019-12-07 13:22:35,792 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 13:22:35,792 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 13:22:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 13:22:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2019-12-07 13:22:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 439 transitions. [2019-12-07 13:22:35,797 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 439 transitions. Word has length 110 [2019-12-07 13:22:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:35,797 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 439 transitions. [2019-12-07 13:22:35,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 439 transitions. [2019-12-07 13:22:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 13:22:35,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:35,797 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, 1, 1] [2019-12-07 13:22:35,798 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1658939710, now seen corresponding path program 1 times [2019-12-07 13:22:35,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:35,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070731201] [2019-12-07 13:22:35,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:35,844 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 13:22:35,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070731201] [2019-12-07 13:22:35,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:35,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:35,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729175914] [2019-12-07 13:22:35,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:35,845 INFO L87 Difference]: Start difference. First operand 291 states and 439 transitions. Second operand 4 states. [2019-12-07 13:22:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:36,089 INFO L93 Difference]: Finished difference Result 605 states and 917 transitions. [2019-12-07 13:22:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:36,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 13:22:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:36,091 INFO L225 Difference]: With dead ends: 605 [2019-12-07 13:22:36,091 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 13:22:36,092 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 13:22:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 13:22:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2019-12-07 13:22:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 438 transitions. [2019-12-07 13:22:36,096 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 438 transitions. Word has length 111 [2019-12-07 13:22:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:36,096 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 438 transitions. [2019-12-07 13:22:36,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 438 transitions. [2019-12-07 13:22:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 13:22:36,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:36,097 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, 1, 1] [2019-12-07 13:22:36,097 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 246964595, now seen corresponding path program 1 times [2019-12-07 13:22:36,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:36,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775142775] [2019-12-07 13:22:36,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:36,135 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 13:22:36,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775142775] [2019-12-07 13:22:36,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:36,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:36,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043351653] [2019-12-07 13:22:36,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:36,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:36,136 INFO L87 Difference]: Start difference. First operand 291 states and 438 transitions. Second operand 4 states. [2019-12-07 13:22:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:36,415 INFO L93 Difference]: Finished difference Result 603 states and 913 transitions. [2019-12-07 13:22:36,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:36,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 13:22:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:36,416 INFO L225 Difference]: With dead ends: 603 [2019-12-07 13:22:36,417 INFO L226 Difference]: Without dead ends: 331 [2019-12-07 13:22:36,417 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 13:22:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-07 13:22:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-12-07 13:22:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 437 transitions. [2019-12-07 13:22:36,421 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 437 transitions. Word has length 111 [2019-12-07 13:22:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:36,421 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 437 transitions. [2019-12-07 13:22:36,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 437 transitions. [2019-12-07 13:22:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 13:22:36,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:36,422 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, 1, 1] [2019-12-07 13:22:36,422 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2008149001, now seen corresponding path program 1 times [2019-12-07 13:22:36,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:36,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531582481] [2019-12-07 13:22:36,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:36,459 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 13:22:36,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531582481] [2019-12-07 13:22:36,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:36,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:36,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159975359] [2019-12-07 13:22:36,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:36,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:36,460 INFO L87 Difference]: Start difference. First operand 291 states and 437 transitions. Second operand 4 states. [2019-12-07 13:22:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:36,695 INFO L93 Difference]: Finished difference Result 601 states and 908 transitions. [2019-12-07 13:22:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:36,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 13:22:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:36,697 INFO L225 Difference]: With dead ends: 601 [2019-12-07 13:22:36,697 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 13:22:36,697 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 13:22:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 13:22:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2019-12-07 13:22:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2019-12-07 13:22:36,702 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 112 [2019-12-07 13:22:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:36,702 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2019-12-07 13:22:36,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2019-12-07 13:22:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 13:22:36,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:36,703 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, 1, 1] [2019-12-07 13:22:36,703 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash 123475374, now seen corresponding path program 1 times [2019-12-07 13:22:36,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:36,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393571229] [2019-12-07 13:22:36,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:36,741 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 13:22:36,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393571229] [2019-12-07 13:22:36,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:36,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:36,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915507724] [2019-12-07 13:22:36,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:36,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:36,742 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand 4 states. [2019-12-07 13:22:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:36,980 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-12-07 13:22:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:36,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 13:22:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:36,983 INFO L225 Difference]: With dead ends: 598 [2019-12-07 13:22:36,983 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 13:22:36,983 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 13:22:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 13:22:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2019-12-07 13:22:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2019-12-07 13:22:36,988 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2019-12-07 13:22:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:36,988 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2019-12-07 13:22:36,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2019-12-07 13:22:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 13:22:36,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:36,989 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, 1, 1, 1] [2019-12-07 13:22:36,989 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:36,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1099399623, now seen corresponding path program 1 times [2019-12-07 13:22:36,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:36,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239550724] [2019-12-07 13:22:36,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:37,030 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 13:22:37,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239550724] [2019-12-07 13:22:37,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:37,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:37,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561689478] [2019-12-07 13:22:37,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:37,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:37,031 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand 4 states. [2019-12-07 13:22:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:37,263 INFO L93 Difference]: Finished difference Result 598 states and 900 transitions. [2019-12-07 13:22:37,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:37,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 13:22:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:37,265 INFO L225 Difference]: With dead ends: 598 [2019-12-07 13:22:37,265 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 13:22:37,265 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 13:22:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 13:22:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2019-12-07 13:22:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2019-12-07 13:22:37,270 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 115 [2019-12-07 13:22:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:37,270 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2019-12-07 13:22:37,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2019-12-07 13:22:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 13:22:37,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:37,271 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, 1, 1, 1] [2019-12-07 13:22:37,271 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash -868715753, now seen corresponding path program 1 times [2019-12-07 13:22:37,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:37,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532557135] [2019-12-07 13:22:37,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:37,310 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 13:22:37,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532557135] [2019-12-07 13:22:37,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:37,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:37,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302482109] [2019-12-07 13:22:37,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:37,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:37,311 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand 4 states. [2019-12-07 13:22:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:37,539 INFO L93 Difference]: Finished difference Result 592 states and 889 transitions. [2019-12-07 13:22:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:37,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 13:22:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:37,541 INFO L225 Difference]: With dead ends: 592 [2019-12-07 13:22:37,542 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 13:22:37,542 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 13:22:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 13:22:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2019-12-07 13:22:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2019-12-07 13:22:37,546 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 116 [2019-12-07 13:22:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:37,547 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2019-12-07 13:22:37,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2019-12-07 13:22:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 13:22:37,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:37,547 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, 1, 1, 1] [2019-12-07 13:22:37,547 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1364168669, now seen corresponding path program 1 times [2019-12-07 13:22:37,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:37,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432485620] [2019-12-07 13:22:37,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:37,598 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 13:22:37,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432485620] [2019-12-07 13:22:37,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:37,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:37,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346830975] [2019-12-07 13:22:37,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:37,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:37,599 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand 4 states. [2019-12-07 13:22:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:37,852 INFO L93 Difference]: Finished difference Result 592 states and 887 transitions. [2019-12-07 13:22:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:37,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 13:22:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:37,854 INFO L225 Difference]: With dead ends: 592 [2019-12-07 13:22:37,854 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 13:22:37,854 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 13:22:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 13:22:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2019-12-07 13:22:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2019-12-07 13:22:37,859 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 116 [2019-12-07 13:22:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:37,859 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2019-12-07 13:22:37,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2019-12-07 13:22:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 13:22:37,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:37,860 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, 1, 1, 1] [2019-12-07 13:22:37,860 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -816836065, now seen corresponding path program 1 times [2019-12-07 13:22:37,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:37,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608982764] [2019-12-07 13:22:37,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:37,901 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 13:22:37,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608982764] [2019-12-07 13:22:37,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:37,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:37,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364641865] [2019-12-07 13:22:37,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:37,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:37,902 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand 4 states. [2019-12-07 13:22:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:38,339 INFO L93 Difference]: Finished difference Result 589 states and 881 transitions. [2019-12-07 13:22:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:38,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 13:22:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:38,343 INFO L225 Difference]: With dead ends: 589 [2019-12-07 13:22:38,343 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 13:22:38,344 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 13:22:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 13:22:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2019-12-07 13:22:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2019-12-07 13:22:38,356 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 117 [2019-12-07 13:22:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:38,357 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2019-12-07 13:22:38,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2019-12-07 13:22:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 13:22:38,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:38,358 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, 1, 1, 1] [2019-12-07 13:22:38,359 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 144074853, now seen corresponding path program 1 times [2019-12-07 13:22:38,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:38,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3652958] [2019-12-07 13:22:38,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:38,408 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 13:22:38,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3652958] [2019-12-07 13:22:38,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:38,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:38,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852448914] [2019-12-07 13:22:38,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:38,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:38,409 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 4 states. [2019-12-07 13:22:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:38,645 INFO L93 Difference]: Finished difference Result 589 states and 879 transitions. [2019-12-07 13:22:38,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:38,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 13:22:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:38,647 INFO L225 Difference]: With dead ends: 589 [2019-12-07 13:22:38,647 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 13:22:38,647 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 13:22:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 13:22:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2019-12-07 13:22:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 13:22:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2019-12-07 13:22:38,652 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 118 [2019-12-07 13:22:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:38,652 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2019-12-07 13:22:38,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2019-12-07 13:22:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 13:22:38,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:38,653 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, 1, 1] [2019-12-07 13:22:38,653 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash 923316267, now seen corresponding path program 1 times [2019-12-07 13:22:38,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:38,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255043845] [2019-12-07 13:22:38,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:38,693 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 13:22:38,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255043845] [2019-12-07 13:22:38,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:38,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:38,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524120549] [2019-12-07 13:22:38,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:38,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:38,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:38,694 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand 4 states. [2019-12-07 13:22:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:38,952 INFO L93 Difference]: Finished difference Result 635 states and 950 transitions. [2019-12-07 13:22:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:38,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 13:22:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:38,954 INFO L225 Difference]: With dead ends: 635 [2019-12-07 13:22:38,954 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 13:22:38,954 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 13:22:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 13:22:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2019-12-07 13:22:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 13:22:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 487 transitions. [2019-12-07 13:22:38,960 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 487 transitions. Word has length 118 [2019-12-07 13:22:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:38,960 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 487 transitions. [2019-12-07 13:22:38,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 487 transitions. [2019-12-07 13:22:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 13:22:38,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:38,961 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, 1, 1, 1] [2019-12-07 13:22:38,961 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -599704185, now seen corresponding path program 1 times [2019-12-07 13:22:38,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:38,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315453098] [2019-12-07 13:22:38,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:39,002 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 13:22:39,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315453098] [2019-12-07 13:22:39,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:39,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:39,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648691498] [2019-12-07 13:22:39,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:39,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:39,003 INFO L87 Difference]: Start difference. First operand 323 states and 487 transitions. Second operand 4 states. [2019-12-07 13:22:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:39,228 INFO L93 Difference]: Finished difference Result 650 states and 987 transitions. [2019-12-07 13:22:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:39,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 13:22:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:39,230 INFO L225 Difference]: With dead ends: 650 [2019-12-07 13:22:39,230 INFO L226 Difference]: Without dead ends: 346 [2019-12-07 13:22:39,230 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 13:22:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-07 13:22:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2019-12-07 13:22:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 13:22:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 486 transitions. [2019-12-07 13:22:39,236 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 486 transitions. Word has length 119 [2019-12-07 13:22:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:39,236 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 486 transitions. [2019-12-07 13:22:39,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 486 transitions. [2019-12-07 13:22:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 13:22:39,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:39,236 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, 1] [2019-12-07 13:22:39,237 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 475698414, now seen corresponding path program 1 times [2019-12-07 13:22:39,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:39,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649246156] [2019-12-07 13:22:39,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:39,276 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 13:22:39,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649246156] [2019-12-07 13:22:39,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:39,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:39,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112354599] [2019-12-07 13:22:39,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:39,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:39,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:39,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:39,277 INFO L87 Difference]: Start difference. First operand 323 states and 486 transitions. Second operand 4 states. [2019-12-07 13:22:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:39,609 INFO L93 Difference]: Finished difference Result 739 states and 1126 transitions. [2019-12-07 13:22:39,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:39,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 13:22:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:39,611 INFO L225 Difference]: With dead ends: 739 [2019-12-07 13:22:39,611 INFO L226 Difference]: Without dead ends: 435 [2019-12-07 13:22:39,612 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 13:22:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-07 13:22:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 362. [2019-12-07 13:22:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-07 13:22:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 557 transitions. [2019-12-07 13:22:39,618 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 557 transitions. Word has length 119 [2019-12-07 13:22:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:39,618 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 557 transitions. [2019-12-07 13:22:39,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 557 transitions. [2019-12-07 13:22:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 13:22:39,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:39,619 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, 1, 1] [2019-12-07 13:22:39,619 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2003600918, now seen corresponding path program 1 times [2019-12-07 13:22:39,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:39,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042027188] [2019-12-07 13:22:39,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:39,666 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 13:22:39,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042027188] [2019-12-07 13:22:39,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:39,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:39,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092186192] [2019-12-07 13:22:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:39,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:39,667 INFO L87 Difference]: Start difference. First operand 362 states and 557 transitions. Second operand 4 states. [2019-12-07 13:22:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:39,982 INFO L93 Difference]: Finished difference Result 769 states and 1183 transitions. [2019-12-07 13:22:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:39,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 13:22:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:39,984 INFO L225 Difference]: With dead ends: 769 [2019-12-07 13:22:39,984 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 13:22:39,985 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 13:22:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 13:22:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 361. [2019-12-07 13:22:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 13:22:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 556 transitions. [2019-12-07 13:22:39,991 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 556 transitions. Word has length 120 [2019-12-07 13:22:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:39,991 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 556 transitions. [2019-12-07 13:22:39,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 556 transitions. [2019-12-07 13:22:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 13:22:39,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:39,992 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, 1, 1] [2019-12-07 13:22:39,992 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash -661501137, now seen corresponding path program 1 times [2019-12-07 13:22:39,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:39,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742575355] [2019-12-07 13:22:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:40,028 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 13:22:40,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742575355] [2019-12-07 13:22:40,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:40,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:40,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482423224] [2019-12-07 13:22:40,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:40,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:40,029 INFO L87 Difference]: Start difference. First operand 361 states and 556 transitions. Second operand 4 states. [2019-12-07 13:22:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:40,297 INFO L93 Difference]: Finished difference Result 730 states and 1125 transitions. [2019-12-07 13:22:40,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:40,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 13:22:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:40,299 INFO L225 Difference]: With dead ends: 730 [2019-12-07 13:22:40,300 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 13:22:40,300 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 13:22:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 13:22:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-12-07 13:22:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 13:22:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 555 transitions. [2019-12-07 13:22:40,307 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 555 transitions. Word has length 120 [2019-12-07 13:22:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:40,307 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 555 transitions. [2019-12-07 13:22:40,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 555 transitions. [2019-12-07 13:22:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 13:22:40,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:40,308 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, 1, 1] [2019-12-07 13:22:40,308 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash -972713678, now seen corresponding path program 1 times [2019-12-07 13:22:40,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:40,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592739381] [2019-12-07 13:22:40,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:40,344 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 13:22:40,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592739381] [2019-12-07 13:22:40,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:40,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538654314] [2019-12-07 13:22:40,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:40,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:40,346 INFO L87 Difference]: Start difference. First operand 361 states and 555 transitions. Second operand 4 states. [2019-12-07 13:22:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:40,577 INFO L93 Difference]: Finished difference Result 730 states and 1123 transitions. [2019-12-07 13:22:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:40,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 13:22:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:40,579 INFO L225 Difference]: With dead ends: 730 [2019-12-07 13:22:40,579 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 13:22:40,580 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 13:22:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 13:22:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-12-07 13:22:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 13:22:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 554 transitions. [2019-12-07 13:22:40,585 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 554 transitions. Word has length 121 [2019-12-07 13:22:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:40,585 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 554 transitions. [2019-12-07 13:22:40,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 554 transitions. [2019-12-07 13:22:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 13:22:40,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:40,586 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, 1, 1] [2019-12-07 13:22:40,586 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2069164652, now seen corresponding path program 1 times [2019-12-07 13:22:40,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:40,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594227715] [2019-12-07 13:22:40,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:40,623 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 13:22:40,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594227715] [2019-12-07 13:22:40,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:40,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:40,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018039701] [2019-12-07 13:22:40,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:40,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:40,624 INFO L87 Difference]: Start difference. First operand 361 states and 554 transitions. Second operand 4 states. [2019-12-07 13:22:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:40,839 INFO L93 Difference]: Finished difference Result 730 states and 1121 transitions. [2019-12-07 13:22:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:40,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 13:22:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:40,841 INFO L225 Difference]: With dead ends: 730 [2019-12-07 13:22:40,841 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 13:22:40,842 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 13:22:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 13:22:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-12-07 13:22:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 13:22:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 553 transitions. [2019-12-07 13:22:40,848 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 553 transitions. Word has length 122 [2019-12-07 13:22:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:40,848 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 553 transitions. [2019-12-07 13:22:40,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 553 transitions. [2019-12-07 13:22:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 13:22:40,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:40,848 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, 1, 1] [2019-12-07 13:22:40,849 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1738203273, now seen corresponding path program 1 times [2019-12-07 13:22:40,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:40,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004244687] [2019-12-07 13:22:40,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:40,884 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 13:22:40,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004244687] [2019-12-07 13:22:40,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:40,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:40,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097888756] [2019-12-07 13:22:40,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:40,885 INFO L87 Difference]: Start difference. First operand 361 states and 553 transitions. Second operand 4 states. [2019-12-07 13:22:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:41,135 INFO L93 Difference]: Finished difference Result 720 states and 1107 transitions. [2019-12-07 13:22:41,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:41,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 13:22:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:41,138 INFO L225 Difference]: With dead ends: 720 [2019-12-07 13:22:41,139 INFO L226 Difference]: Without dead ends: 378 [2019-12-07 13:22:41,139 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 13:22:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-07 13:22:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2019-12-07 13:22:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 13:22:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2019-12-07 13:22:41,150 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 123 [2019-12-07 13:22:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:41,150 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2019-12-07 13:22:41,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2019-12-07 13:22:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 13:22:41,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:41,151 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 13:22:41,152 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash -213721941, now seen corresponding path program 1 times [2019-12-07 13:22:41,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:41,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918790604] [2019-12-07 13:22:41,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:41,192 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 13:22:41,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918790604] [2019-12-07 13:22:41,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:41,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:22:41,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248408621] [2019-12-07 13:22:41,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:22:41,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:41,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:22:41,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:22:41,193 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2019-12-07 13:22:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:41,257 INFO L93 Difference]: Finished difference Result 1041 states and 1607 transitions. [2019-12-07 13:22:41,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:22:41,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-12-07 13:22:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:41,259 INFO L225 Difference]: With dead ends: 1041 [2019-12-07 13:22:41,259 INFO L226 Difference]: Without dead ends: 699 [2019-12-07 13:22:41,260 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 13:22:41,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-12-07 13:22:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2019-12-07 13:22:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-07 13:22:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1058 transitions. [2019-12-07 13:22:41,271 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1058 transitions. Word has length 124 [2019-12-07 13:22:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:41,271 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1058 transitions. [2019-12-07 13:22:41,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:22:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1058 transitions. [2019-12-07 13:22:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 13:22:41,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:41,272 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, 1, 1, 1] [2019-12-07 13:22:41,272 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash -181093733, now seen corresponding path program 1 times [2019-12-07 13:22:41,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:41,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486619717] [2019-12-07 13:22:41,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:41,316 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 13:22:41,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486619717] [2019-12-07 13:22:41,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:41,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:41,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457463606] [2019-12-07 13:22:41,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:41,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:41,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:41,317 INFO L87 Difference]: Start difference. First operand 697 states and 1058 transitions. Second operand 4 states. [2019-12-07 13:22:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:41,657 INFO L93 Difference]: Finished difference Result 1595 states and 2430 transitions. [2019-12-07 13:22:41,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:41,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-12-07 13:22:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:41,660 INFO L225 Difference]: With dead ends: 1595 [2019-12-07 13:22:41,660 INFO L226 Difference]: Without dead ends: 917 [2019-12-07 13:22:41,661 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 13:22:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-07 13:22:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 775. [2019-12-07 13:22:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-12-07 13:22:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1200 transitions. [2019-12-07 13:22:41,674 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1200 transitions. Word has length 127 [2019-12-07 13:22:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:41,674 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1200 transitions. [2019-12-07 13:22:41,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1200 transitions. [2019-12-07 13:22:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-07 13:22:41,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:41,675 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:41,675 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1177086455, now seen corresponding path program 1 times [2019-12-07 13:22:41,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:41,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692257163] [2019-12-07 13:22:41,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:41,715 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 13:22:41,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692257163] [2019-12-07 13:22:41,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:41,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:41,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649500222] [2019-12-07 13:22:41,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:41,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:41,716 INFO L87 Difference]: Start difference. First operand 775 states and 1200 transitions. Second operand 4 states. [2019-12-07 13:22:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:42,042 INFO L93 Difference]: Finished difference Result 1659 states and 2552 transitions. [2019-12-07 13:22:42,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:42,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-12-07 13:22:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:42,046 INFO L225 Difference]: With dead ends: 1659 [2019-12-07 13:22:42,046 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 13:22:42,047 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 13:22:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 13:22:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 697. [2019-12-07 13:22:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-07 13:22:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1058 transitions. [2019-12-07 13:22:42,059 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1058 transitions. Word has length 128 [2019-12-07 13:22:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:42,059 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1058 transitions. [2019-12-07 13:22:42,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1058 transitions. [2019-12-07 13:22:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 13:22:42,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:42,060 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:42,060 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:42,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1073512160, now seen corresponding path program 1 times [2019-12-07 13:22:42,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:42,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446794468] [2019-12-07 13:22:42,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:42,106 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 13:22:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446794468] [2019-12-07 13:22:42,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:42,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:42,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083189563] [2019-12-07 13:22:42,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:42,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:42,107 INFO L87 Difference]: Start difference. First operand 697 states and 1058 transitions. Second operand 4 states. [2019-12-07 13:22:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:42,331 INFO L93 Difference]: Finished difference Result 1407 states and 2138 transitions. [2019-12-07 13:22:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:42,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-12-07 13:22:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:42,334 INFO L225 Difference]: With dead ends: 1407 [2019-12-07 13:22:42,334 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 13:22:42,335 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 13:22:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 13:22:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2019-12-07 13:22:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-07 13:22:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2019-12-07 13:22:42,347 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 129 [2019-12-07 13:22:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:42,347 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2019-12-07 13:22:42,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2019-12-07 13:22:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 13:22:42,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:42,348 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, 1, 1] [2019-12-07 13:22:42,348 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1409563339, now seen corresponding path program 1 times [2019-12-07 13:22:42,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:42,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373712142] [2019-12-07 13:22:42,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:42,386 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 13:22:42,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373712142] [2019-12-07 13:22:42,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:42,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:42,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840214029] [2019-12-07 13:22:42,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:42,387 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2019-12-07 13:22:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:42,593 INFO L93 Difference]: Finished difference Result 1421 states and 2152 transitions. [2019-12-07 13:22:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:42,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 13:22:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:42,596 INFO L225 Difference]: With dead ends: 1421 [2019-12-07 13:22:42,597 INFO L226 Difference]: Without dead ends: 737 [2019-12-07 13:22:42,597 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 13:22:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-07 13:22:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 703. [2019-12-07 13:22:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-07 13:22:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1062 transitions. [2019-12-07 13:22:42,609 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1062 transitions. Word has length 133 [2019-12-07 13:22:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:42,609 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1062 transitions. [2019-12-07 13:22:42,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1062 transitions. [2019-12-07 13:22:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 13:22:42,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:42,610 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, 1, 1] [2019-12-07 13:22:42,611 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1255557316, now seen corresponding path program 1 times [2019-12-07 13:22:42,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:42,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380585835] [2019-12-07 13:22:42,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:42,649 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 13:22:42,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380585835] [2019-12-07 13:22:42,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:42,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:42,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705081971] [2019-12-07 13:22:42,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:42,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:42,651 INFO L87 Difference]: Start difference. First operand 703 states and 1062 transitions. Second operand 4 states. [2019-12-07 13:22:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:42,916 INFO L93 Difference]: Finished difference Result 1513 states and 2298 transitions. [2019-12-07 13:22:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:42,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 13:22:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:42,920 INFO L225 Difference]: With dead ends: 1513 [2019-12-07 13:22:42,920 INFO L226 Difference]: Without dead ends: 829 [2019-12-07 13:22:42,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 13:22:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-12-07 13:22:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 759. [2019-12-07 13:22:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 13:22:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1160 transitions. [2019-12-07 13:22:42,933 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1160 transitions. Word has length 133 [2019-12-07 13:22:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:42,933 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1160 transitions. [2019-12-07 13:22:42,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1160 transitions. [2019-12-07 13:22:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 13:22:42,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:42,934 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, 1, 1] [2019-12-07 13:22:42,935 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:42,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1833882926, now seen corresponding path program 1 times [2019-12-07 13:22:42,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:42,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634139779] [2019-12-07 13:22:42,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:42,971 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 13:22:42,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634139779] [2019-12-07 13:22:42,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:42,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:42,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866512624] [2019-12-07 13:22:42,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:42,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:42,972 INFO L87 Difference]: Start difference. First operand 759 states and 1160 transitions. Second operand 4 states. [2019-12-07 13:22:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:43,194 INFO L93 Difference]: Finished difference Result 1529 states and 2340 transitions. [2019-12-07 13:22:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:43,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 13:22:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:43,197 INFO L225 Difference]: With dead ends: 1529 [2019-12-07 13:22:43,197 INFO L226 Difference]: Without dead ends: 789 [2019-12-07 13:22:43,198 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 13:22:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-07 13:22:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 759. [2019-12-07 13:22:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 13:22:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1158 transitions. [2019-12-07 13:22:43,211 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1158 transitions. Word has length 134 [2019-12-07 13:22:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:43,211 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1158 transitions. [2019-12-07 13:22:43,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1158 transitions. [2019-12-07 13:22:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 13:22:43,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:43,212 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, 1, 1] [2019-12-07 13:22:43,212 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 373383698, now seen corresponding path program 1 times [2019-12-07 13:22:43,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:43,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357720991] [2019-12-07 13:22:43,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:43,247 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 13:22:43,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357720991] [2019-12-07 13:22:43,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:43,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:43,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046155795] [2019-12-07 13:22:43,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:43,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:43,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:43,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:43,248 INFO L87 Difference]: Start difference. First operand 759 states and 1158 transitions. Second operand 4 states. [2019-12-07 13:22:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:43,536 INFO L93 Difference]: Finished difference Result 1705 states and 2608 transitions. [2019-12-07 13:22:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:43,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 13:22:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:43,540 INFO L225 Difference]: With dead ends: 1705 [2019-12-07 13:22:43,540 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 13:22:43,540 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 13:22:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 13:22:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 783. [2019-12-07 13:22:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 13:22:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1192 transitions. [2019-12-07 13:22:43,554 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1192 transitions. Word has length 134 [2019-12-07 13:22:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:43,554 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1192 transitions. [2019-12-07 13:22:43,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1192 transitions. [2019-12-07 13:22:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 13:22:43,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:43,555 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, 1, 1] [2019-12-07 13:22:43,555 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1043945135, now seen corresponding path program 1 times [2019-12-07 13:22:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:43,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236754325] [2019-12-07 13:22:43,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:43,590 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 13:22:43,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236754325] [2019-12-07 13:22:43,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:43,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:43,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936861846] [2019-12-07 13:22:43,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:43,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:43,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:43,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:43,591 INFO L87 Difference]: Start difference. First operand 783 states and 1192 transitions. Second operand 4 states. [2019-12-07 13:22:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:43,909 INFO L93 Difference]: Finished difference Result 1729 states and 2640 transitions. [2019-12-07 13:22:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:43,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 13:22:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:43,912 INFO L225 Difference]: With dead ends: 1729 [2019-12-07 13:22:43,912 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 13:22:43,913 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 13:22:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 13:22:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 785. [2019-12-07 13:22:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-12-07 13:22:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1194 transitions. [2019-12-07 13:22:43,927 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1194 transitions. Word has length 135 [2019-12-07 13:22:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:43,927 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1194 transitions. [2019-12-07 13:22:43,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1194 transitions. [2019-12-07 13:22:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 13:22:43,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:43,928 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, 1, 1] [2019-12-07 13:22:43,928 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash 317716407, now seen corresponding path program 1 times [2019-12-07 13:22:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852272936] [2019-12-07 13:22:43,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:43,962 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 13:22:43,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852272936] [2019-12-07 13:22:43,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:43,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:43,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46329938] [2019-12-07 13:22:43,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:43,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:43,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:43,963 INFO L87 Difference]: Start difference. First operand 785 states and 1194 transitions. Second operand 4 states. [2019-12-07 13:22:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:44,268 INFO L93 Difference]: Finished difference Result 1731 states and 2640 transitions. [2019-12-07 13:22:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:44,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 13:22:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:44,272 INFO L225 Difference]: With dead ends: 1731 [2019-12-07 13:22:44,272 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 13:22:44,273 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 13:22:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 13:22:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 787. [2019-12-07 13:22:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-12-07 13:22:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1196 transitions. [2019-12-07 13:22:44,288 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1196 transitions. Word has length 136 [2019-12-07 13:22:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:44,289 INFO L462 AbstractCegarLoop]: Abstraction has 787 states and 1196 transitions. [2019-12-07 13:22:44,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1196 transitions. [2019-12-07 13:22:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 13:22:44,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:44,290 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, 1, 1] [2019-12-07 13:22:44,290 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -759334476, now seen corresponding path program 1 times [2019-12-07 13:22:44,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:44,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283559726] [2019-12-07 13:22:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:44,327 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 13:22:44,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283559726] [2019-12-07 13:22:44,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:44,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:44,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968297081] [2019-12-07 13:22:44,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:44,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:44,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:44,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:44,328 INFO L87 Difference]: Start difference. First operand 787 states and 1196 transitions. Second operand 4 states. [2019-12-07 13:22:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:44,618 INFO L93 Difference]: Finished difference Result 1713 states and 2616 transitions. [2019-12-07 13:22:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:44,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 13:22:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:44,621 INFO L225 Difference]: With dead ends: 1713 [2019-12-07 13:22:44,621 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 13:22:44,621 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 13:22:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 13:22:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-12-07 13:22:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 13:22:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1198 transitions. [2019-12-07 13:22:44,636 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1198 transitions. Word has length 137 [2019-12-07 13:22:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:44,636 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1198 transitions. [2019-12-07 13:22:44,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1198 transitions. [2019-12-07 13:22:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 13:22:44,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:44,637 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:44,637 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1295283003, now seen corresponding path program 1 times [2019-12-07 13:22:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414850484] [2019-12-07 13:22:44,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:44,673 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 13:22:44,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414850484] [2019-12-07 13:22:44,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:44,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:44,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184143461] [2019-12-07 13:22:44,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:44,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:44,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:44,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:44,674 INFO L87 Difference]: Start difference. First operand 789 states and 1198 transitions. Second operand 4 states. [2019-12-07 13:22:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:44,985 INFO L93 Difference]: Finished difference Result 1735 states and 2640 transitions. [2019-12-07 13:22:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:44,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 13:22:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:44,988 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 13:22:44,988 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 13:22:44,989 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 13:22:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 13:22:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 789. [2019-12-07 13:22:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 13:22:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1196 transitions. [2019-12-07 13:22:45,004 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1196 transitions. Word has length 142 [2019-12-07 13:22:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:45,005 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1196 transitions. [2019-12-07 13:22:45,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1196 transitions. [2019-12-07 13:22:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 13:22:45,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:45,006 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:45,006 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:45,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 854884956, now seen corresponding path program 1 times [2019-12-07 13:22:45,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:45,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970624713] [2019-12-07 13:22:45,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:45,057 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 13:22:45,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970624713] [2019-12-07 13:22:45,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:45,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:45,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367927913] [2019-12-07 13:22:45,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:45,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:45,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:45,058 INFO L87 Difference]: Start difference. First operand 789 states and 1196 transitions. Second operand 4 states. [2019-12-07 13:22:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:45,394 INFO L93 Difference]: Finished difference Result 1735 states and 2636 transitions. [2019-12-07 13:22:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:45,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 13:22:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:45,396 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 13:22:45,396 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 13:22:45,396 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 13:22:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 13:22:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 789. [2019-12-07 13:22:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 13:22:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1194 transitions. [2019-12-07 13:22:45,411 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1194 transitions. Word has length 143 [2019-12-07 13:22:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:45,411 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1194 transitions. [2019-12-07 13:22:45,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1194 transitions. [2019-12-07 13:22:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 13:22:45,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:45,413 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:45,413 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1248181846, now seen corresponding path program 1 times [2019-12-07 13:22:45,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:45,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149026129] [2019-12-07 13:22:45,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:45,448 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 13:22:45,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149026129] [2019-12-07 13:22:45,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:45,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:45,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023760252] [2019-12-07 13:22:45,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:45,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:45,449 INFO L87 Difference]: Start difference. First operand 789 states and 1194 transitions. Second operand 4 states. [2019-12-07 13:22:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:45,784 INFO L93 Difference]: Finished difference Result 1735 states and 2632 transitions. [2019-12-07 13:22:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:45,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-12-07 13:22:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:45,785 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 13:22:45,785 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 13:22:45,786 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 13:22:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 13:22:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 789. [2019-12-07 13:22:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 13:22:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1192 transitions. [2019-12-07 13:22:45,802 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1192 transitions. Word has length 144 [2019-12-07 13:22:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:45,802 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1192 transitions. [2019-12-07 13:22:45,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1192 transitions. [2019-12-07 13:22:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 13:22:45,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:45,803 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, 1, 1] [2019-12-07 13:22:45,803 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 283430609, now seen corresponding path program 1 times [2019-12-07 13:22:45,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:45,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300806991] [2019-12-07 13:22:45,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:45,841 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 13:22:45,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300806991] [2019-12-07 13:22:45,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:45,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:45,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189127127] [2019-12-07 13:22:45,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:45,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:45,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:45,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:45,842 INFO L87 Difference]: Start difference. First operand 789 states and 1192 transitions. Second operand 4 states. [2019-12-07 13:22:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:46,129 INFO L93 Difference]: Finished difference Result 1715 states and 2604 transitions. [2019-12-07 13:22:46,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:46,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-12-07 13:22:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:46,130 INFO L225 Difference]: With dead ends: 1715 [2019-12-07 13:22:46,131 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 13:22:46,131 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 13:22:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 13:22:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 815. [2019-12-07 13:22:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-07 13:22:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1242 transitions. [2019-12-07 13:22:46,147 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1242 transitions. Word has length 144 [2019-12-07 13:22:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:46,147 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1242 transitions. [2019-12-07 13:22:46,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1242 transitions. [2019-12-07 13:22:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 13:22:46,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:46,149 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:46,149 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2057540063, now seen corresponding path program 1 times [2019-12-07 13:22:46,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:46,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517278106] [2019-12-07 13:22:46,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:46,187 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 13:22:46,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517278106] [2019-12-07 13:22:46,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:46,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:46,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736577994] [2019-12-07 13:22:46,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:46,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:46,188 INFO L87 Difference]: Start difference. First operand 815 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:46,513 INFO L93 Difference]: Finished difference Result 1741 states and 2652 transitions. [2019-12-07 13:22:46,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:46,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 13:22:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:46,515 INFO L225 Difference]: With dead ends: 1741 [2019-12-07 13:22:46,515 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 13:22:46,515 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 13:22:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 13:22:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 815. [2019-12-07 13:22:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-07 13:22:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1240 transitions. [2019-12-07 13:22:46,533 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1240 transitions. Word has length 145 [2019-12-07 13:22:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:46,533 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1240 transitions. [2019-12-07 13:22:46,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1240 transitions. [2019-12-07 13:22:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 13:22:46,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:46,535 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, 1, 1] [2019-12-07 13:22:46,535 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash 391170094, now seen corresponding path program 1 times [2019-12-07 13:22:46,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:46,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120980012] [2019-12-07 13:22:46,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:46,573 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 13:22:46,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120980012] [2019-12-07 13:22:46,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:46,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:46,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063991648] [2019-12-07 13:22:46,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:46,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:46,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:46,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:46,574 INFO L87 Difference]: Start difference. First operand 815 states and 1240 transitions. Second operand 4 states. [2019-12-07 13:22:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:46,849 INFO L93 Difference]: Finished difference Result 1725 states and 2622 transitions. [2019-12-07 13:22:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:46,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 13:22:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:46,850 INFO L225 Difference]: With dead ends: 1725 [2019-12-07 13:22:46,850 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 13:22:46,851 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 13:22:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 13:22:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 817. [2019-12-07 13:22:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 13:22:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1242 transitions. [2019-12-07 13:22:46,869 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1242 transitions. Word has length 145 [2019-12-07 13:22:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:46,869 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1242 transitions. [2019-12-07 13:22:46,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1242 transitions. [2019-12-07 13:22:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 13:22:46,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:46,870 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, 1, 1] [2019-12-07 13:22:46,870 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1180027086, now seen corresponding path program 1 times [2019-12-07 13:22:46,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:46,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587530664] [2019-12-07 13:22:46,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:46,919 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 13:22:46,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587530664] [2019-12-07 13:22:46,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:46,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:46,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387678924] [2019-12-07 13:22:46,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:46,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:46,920 INFO L87 Difference]: Start difference. First operand 817 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:47,205 INFO L93 Difference]: Finished difference Result 1727 states and 2622 transitions. [2019-12-07 13:22:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:47,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 13:22:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:47,207 INFO L225 Difference]: With dead ends: 1727 [2019-12-07 13:22:47,207 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 13:22:47,207 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 13:22:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 13:22:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 817. [2019-12-07 13:22:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 13:22:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1240 transitions. [2019-12-07 13:22:47,224 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1240 transitions. Word has length 147 [2019-12-07 13:22:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:47,225 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1240 transitions. [2019-12-07 13:22:47,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1240 transitions. [2019-12-07 13:22:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 13:22:47,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:47,226 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, 1, 1] [2019-12-07 13:22:47,226 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:47,226 INFO L82 PathProgramCache]: Analyzing trace with hash 986773621, now seen corresponding path program 1 times [2019-12-07 13:22:47,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:47,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667948282] [2019-12-07 13:22:47,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:47,264 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 13:22:47,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667948282] [2019-12-07 13:22:47,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:47,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:47,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537882946] [2019-12-07 13:22:47,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:47,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:47,265 INFO L87 Difference]: Start difference. First operand 817 states and 1240 transitions. Second operand 4 states. [2019-12-07 13:22:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:47,532 INFO L93 Difference]: Finished difference Result 1723 states and 2614 transitions. [2019-12-07 13:22:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:47,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 13:22:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:47,534 INFO L225 Difference]: With dead ends: 1723 [2019-12-07 13:22:47,534 INFO L226 Difference]: Without dead ends: 925 [2019-12-07 13:22:47,534 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 13:22:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-12-07 13:22:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 817. [2019-12-07 13:22:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 13:22:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1238 transitions. [2019-12-07 13:22:47,551 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1238 transitions. Word has length 148 [2019-12-07 13:22:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:47,551 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1238 transitions. [2019-12-07 13:22:47,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1238 transitions. [2019-12-07 13:22:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 13:22:47,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:47,553 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, 1, 1] [2019-12-07 13:22:47,553 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1505929965, now seen corresponding path program 1 times [2019-12-07 13:22:47,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:47,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106447568] [2019-12-07 13:22:47,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:47,594 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 13:22:47,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106447568] [2019-12-07 13:22:47,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:47,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:47,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481930797] [2019-12-07 13:22:47,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:47,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:47,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:47,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:47,595 INFO L87 Difference]: Start difference. First operand 817 states and 1238 transitions. Second operand 4 states. [2019-12-07 13:22:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:47,869 INFO L93 Difference]: Finished difference Result 1717 states and 2602 transitions. [2019-12-07 13:22:47,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:47,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 13:22:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:47,871 INFO L225 Difference]: With dead ends: 1717 [2019-12-07 13:22:47,871 INFO L226 Difference]: Without dead ends: 919 [2019-12-07 13:22:47,871 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 13:22:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-07 13:22:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2019-12-07 13:22:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 13:22:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1248 transitions. [2019-12-07 13:22:47,888 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1248 transitions. Word has length 148 [2019-12-07 13:22:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:47,888 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1248 transitions. [2019-12-07 13:22:47,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1248 transitions. [2019-12-07 13:22:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 13:22:47,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:47,889 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, 1, 1] [2019-12-07 13:22:47,890 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:47,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:47,890 INFO L82 PathProgramCache]: Analyzing trace with hash -8676860, now seen corresponding path program 1 times [2019-12-07 13:22:47,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:47,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181275828] [2019-12-07 13:22:47,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:47,928 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 13:22:47,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181275828] [2019-12-07 13:22:47,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:47,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:47,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456090991] [2019-12-07 13:22:47,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:47,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:47,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:47,929 INFO L87 Difference]: Start difference. First operand 823 states and 1248 transitions. Second operand 4 states. [2019-12-07 13:22:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:48,204 INFO L93 Difference]: Finished difference Result 1697 states and 2570 transitions. [2019-12-07 13:22:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:48,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 13:22:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:48,206 INFO L225 Difference]: With dead ends: 1697 [2019-12-07 13:22:48,207 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 13:22:48,207 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 13:22:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 13:22:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-12-07 13:22:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 13:22:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1246 transitions. [2019-12-07 13:22:48,224 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1246 transitions. Word has length 148 [2019-12-07 13:22:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:48,224 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1246 transitions. [2019-12-07 13:22:48,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1246 transitions. [2019-12-07 13:22:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 13:22:48,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:48,226 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, 1, 1] [2019-12-07 13:22:48,226 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2084969725, now seen corresponding path program 1 times [2019-12-07 13:22:48,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:48,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027264230] [2019-12-07 13:22:48,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:48,265 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 13:22:48,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027264230] [2019-12-07 13:22:48,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:48,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:48,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716794149] [2019-12-07 13:22:48,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:48,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:48,266 INFO L87 Difference]: Start difference. First operand 823 states and 1246 transitions. Second operand 4 states. [2019-12-07 13:22:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:48,555 INFO L93 Difference]: Finished difference Result 1697 states and 2566 transitions. [2019-12-07 13:22:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:48,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 13:22:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:48,556 INFO L225 Difference]: With dead ends: 1697 [2019-12-07 13:22:48,556 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 13:22:48,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 13:22:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 13:22:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-12-07 13:22:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 13:22:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1244 transitions. [2019-12-07 13:22:48,573 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1244 transitions. Word has length 149 [2019-12-07 13:22:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:48,573 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1244 transitions. [2019-12-07 13:22:48,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1244 transitions. [2019-12-07 13:22:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 13:22:48,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:48,575 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, 1, 1] [2019-12-07 13:22:48,575 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1770259671, now seen corresponding path program 1 times [2019-12-07 13:22:48,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:48,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82192863] [2019-12-07 13:22:48,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:48,614 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 13:22:48,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82192863] [2019-12-07 13:22:48,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:48,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:48,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376004138] [2019-12-07 13:22:48,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:48,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:48,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:48,615 INFO L87 Difference]: Start difference. First operand 823 states and 1244 transitions. Second operand 4 states. [2019-12-07 13:22:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:48,914 INFO L93 Difference]: Finished difference Result 1697 states and 2562 transitions. [2019-12-07 13:22:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:48,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 13:22:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:48,915 INFO L225 Difference]: With dead ends: 1697 [2019-12-07 13:22:48,915 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 13:22:48,916 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 13:22:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 13:22:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-12-07 13:22:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 13:22:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1242 transitions. [2019-12-07 13:22:48,935 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1242 transitions. Word has length 150 [2019-12-07 13:22:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:48,935 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1242 transitions. [2019-12-07 13:22:48,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1242 transitions. [2019-12-07 13:22:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 13:22:48,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:48,936 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, 1, 1, 1] [2019-12-07 13:22:48,936 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1890867658, now seen corresponding path program 1 times [2019-12-07 13:22:48,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:48,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119550426] [2019-12-07 13:22:48,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:48,978 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 13:22:48,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119550426] [2019-12-07 13:22:48,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:48,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:48,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195928048] [2019-12-07 13:22:48,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:48,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:48,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:48,979 INFO L87 Difference]: Start difference. First operand 823 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:49,244 INFO L93 Difference]: Finished difference Result 1723 states and 2598 transitions. [2019-12-07 13:22:49,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:49,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 13:22:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:49,245 INFO L225 Difference]: With dead ends: 1723 [2019-12-07 13:22:49,245 INFO L226 Difference]: Without dead ends: 919 [2019-12-07 13:22:49,246 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 13:22:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-07 13:22:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 825. [2019-12-07 13:22:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-07 13:22:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1244 transitions. [2019-12-07 13:22:49,271 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1244 transitions. Word has length 151 [2019-12-07 13:22:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:49,271 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1244 transitions. [2019-12-07 13:22:49,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1244 transitions. [2019-12-07 13:22:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 13:22:49,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:49,273 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, 1, 1] [2019-12-07 13:22:49,273 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1062083454, now seen corresponding path program 1 times [2019-12-07 13:22:49,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:49,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356625523] [2019-12-07 13:22:49,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:49,315 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 13:22:49,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356625523] [2019-12-07 13:22:49,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:49,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:49,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556740108] [2019-12-07 13:22:49,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:49,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:49,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:49,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:49,316 INFO L87 Difference]: Start difference. First operand 825 states and 1244 transitions. Second operand 4 states. [2019-12-07 13:22:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:49,594 INFO L93 Difference]: Finished difference Result 1681 states and 2538 transitions. [2019-12-07 13:22:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:49,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 13:22:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:49,595 INFO L225 Difference]: With dead ends: 1681 [2019-12-07 13:22:49,595 INFO L226 Difference]: Without dead ends: 875 [2019-12-07 13:22:49,595 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 13:22:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-07 13:22:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 825. [2019-12-07 13:22:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-07 13:22:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1242 transitions. [2019-12-07 13:22:49,613 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1242 transitions. Word has length 151 [2019-12-07 13:22:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:49,613 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1242 transitions. [2019-12-07 13:22:49,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1242 transitions. [2019-12-07 13:22:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 13:22:49,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:49,615 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:49,615 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:49,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1439992380, now seen corresponding path program 1 times [2019-12-07 13:22:49,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:49,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741337123] [2019-12-07 13:22:49,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:49,658 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 13:22:49,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741337123] [2019-12-07 13:22:49,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:49,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:49,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145370714] [2019-12-07 13:22:49,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:49,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:49,659 INFO L87 Difference]: Start difference. First operand 825 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:49,997 INFO L93 Difference]: Finished difference Result 1751 states and 2632 transitions. [2019-12-07 13:22:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:49,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 13:22:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:49,998 INFO L225 Difference]: With dead ends: 1751 [2019-12-07 13:22:49,999 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 13:22:49,999 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 13:22:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 13:22:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 825. [2019-12-07 13:22:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-07 13:22:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1240 transitions. [2019-12-07 13:22:50,017 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1240 transitions. Word has length 152 [2019-12-07 13:22:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:50,017 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1240 transitions. [2019-12-07 13:22:50,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:50,018 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1240 transitions. [2019-12-07 13:22:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 13:22:50,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:50,019 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, 1, 1, 1] [2019-12-07 13:22:50,019 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:50,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1517573502, now seen corresponding path program 1 times [2019-12-07 13:22:50,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:50,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861643577] [2019-12-07 13:22:50,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:50,062 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 13:22:50,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861643577] [2019-12-07 13:22:50,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:50,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:50,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567335784] [2019-12-07 13:22:50,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:50,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:50,063 INFO L87 Difference]: Start difference. First operand 825 states and 1240 transitions. Second operand 4 states. [2019-12-07 13:22:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:50,350 INFO L93 Difference]: Finished difference Result 1713 states and 2574 transitions. [2019-12-07 13:22:50,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:50,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 13:22:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:50,351 INFO L225 Difference]: With dead ends: 1713 [2019-12-07 13:22:50,351 INFO L226 Difference]: Without dead ends: 907 [2019-12-07 13:22:50,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 13:22:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-12-07 13:22:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 827. [2019-12-07 13:22:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-07 13:22:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1242 transitions. [2019-12-07 13:22:50,373 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1242 transitions. Word has length 152 [2019-12-07 13:22:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:50,374 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1242 transitions. [2019-12-07 13:22:50,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1242 transitions. [2019-12-07 13:22:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 13:22:50,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:50,375 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, 1, 1, 1] [2019-12-07 13:22:50,375 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 601030400, now seen corresponding path program 1 times [2019-12-07 13:22:50,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:50,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917388077] [2019-12-07 13:22:50,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:50,417 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 13:22:50,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917388077] [2019-12-07 13:22:50,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:50,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:50,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012175887] [2019-12-07 13:22:50,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:50,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:50,418 INFO L87 Difference]: Start difference. First operand 827 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:50,687 INFO L93 Difference]: Finished difference Result 1715 states and 2574 transitions. [2019-12-07 13:22:50,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:50,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 13:22:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:50,688 INFO L225 Difference]: With dead ends: 1715 [2019-12-07 13:22:50,688 INFO L226 Difference]: Without dead ends: 907 [2019-12-07 13:22:50,688 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 13:22:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-12-07 13:22:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 829. [2019-12-07 13:22:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 13:22:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1244 transitions. [2019-12-07 13:22:50,706 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1244 transitions. Word has length 152 [2019-12-07 13:22:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:50,706 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1244 transitions. [2019-12-07 13:22:50,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1244 transitions. [2019-12-07 13:22:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 13:22:50,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:50,707 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:50,707 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1495335013, now seen corresponding path program 1 times [2019-12-07 13:22:50,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:50,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260532544] [2019-12-07 13:22:50,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:50,749 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 13:22:50,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260532544] [2019-12-07 13:22:50,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:50,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:50,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363073071] [2019-12-07 13:22:50,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:50,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:50,750 INFO L87 Difference]: Start difference. First operand 829 states and 1244 transitions. Second operand 4 states. [2019-12-07 13:22:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:51,129 INFO L93 Difference]: Finished difference Result 1739 states and 2602 transitions. [2019-12-07 13:22:51,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:51,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 13:22:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:51,132 INFO L225 Difference]: With dead ends: 1739 [2019-12-07 13:22:51,132 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 13:22:51,133 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 13:22:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 13:22:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 829. [2019-12-07 13:22:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 13:22:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1242 transitions. [2019-12-07 13:22:51,161 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1242 transitions. Word has length 153 [2019-12-07 13:22:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:51,162 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1242 transitions. [2019-12-07 13:22:51,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1242 transitions. [2019-12-07 13:22:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 13:22:51,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:51,163 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, 1, 1, 1] [2019-12-07 13:22:51,163 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1853746152, now seen corresponding path program 1 times [2019-12-07 13:22:51,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:51,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108114850] [2019-12-07 13:22:51,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:51,207 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 13:22:51,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108114850] [2019-12-07 13:22:51,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:51,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:51,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564796957] [2019-12-07 13:22:51,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:51,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:51,208 INFO L87 Difference]: Start difference. First operand 829 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:51,596 INFO L93 Difference]: Finished difference Result 1711 states and 2563 transitions. [2019-12-07 13:22:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:51,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 13:22:51,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:51,600 INFO L225 Difference]: With dead ends: 1711 [2019-12-07 13:22:51,600 INFO L226 Difference]: Without dead ends: 901 [2019-12-07 13:22:51,602 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 13:22:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-07 13:22:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 831. [2019-12-07 13:22:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 13:22:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1244 transitions. [2019-12-07 13:22:51,640 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1244 transitions. Word has length 153 [2019-12-07 13:22:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:51,640 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1244 transitions. [2019-12-07 13:22:51,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1244 transitions. [2019-12-07 13:22:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 13:22:51,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:51,642 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, 1, 1, 1] [2019-12-07 13:22:51,642 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash -789827000, now seen corresponding path program 1 times [2019-12-07 13:22:51,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:51,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507233818] [2019-12-07 13:22:51,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:51,691 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 13:22:51,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507233818] [2019-12-07 13:22:51,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:51,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:51,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935826925] [2019-12-07 13:22:51,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:51,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:51,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:51,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:51,692 INFO L87 Difference]: Start difference. First operand 831 states and 1244 transitions. Second operand 4 states. [2019-12-07 13:22:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:51,962 INFO L93 Difference]: Finished difference Result 1713 states and 2563 transitions. [2019-12-07 13:22:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:51,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 13:22:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:51,963 INFO L225 Difference]: With dead ends: 1713 [2019-12-07 13:22:51,963 INFO L226 Difference]: Without dead ends: 901 [2019-12-07 13:22:51,964 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 13:22:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-07 13:22:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 833. [2019-12-07 13:22:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-07 13:22:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1246 transitions. [2019-12-07 13:22:51,983 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1246 transitions. Word has length 154 [2019-12-07 13:22:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:51,984 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1246 transitions. [2019-12-07 13:22:51,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1246 transitions. [2019-12-07 13:22:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 13:22:51,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:51,985 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:51,985 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:51,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1635236001, now seen corresponding path program 1 times [2019-12-07 13:22:51,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:51,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744220940] [2019-12-07 13:22:51,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:52,024 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 13:22:52,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744220940] [2019-12-07 13:22:52,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:52,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:52,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843865877] [2019-12-07 13:22:52,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:52,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:52,025 INFO L87 Difference]: Start difference. First operand 833 states and 1246 transitions. Second operand 4 states. [2019-12-07 13:22:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:52,304 INFO L93 Difference]: Finished difference Result 1743 states and 2598 transitions. [2019-12-07 13:22:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:52,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 13:22:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:52,306 INFO L225 Difference]: With dead ends: 1743 [2019-12-07 13:22:52,306 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 13:22:52,306 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 13:22:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 13:22:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 833. [2019-12-07 13:22:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-07 13:22:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1244 transitions. [2019-12-07 13:22:52,326 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1244 transitions. Word has length 155 [2019-12-07 13:22:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:52,326 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1244 transitions. [2019-12-07 13:22:52,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1244 transitions. [2019-12-07 13:22:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 13:22:52,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:52,327 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, 1, 1, 1] [2019-12-07 13:22:52,327 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1659649216, now seen corresponding path program 1 times [2019-12-07 13:22:52,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:52,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847168225] [2019-12-07 13:22:52,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:52,369 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 13:22:52,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847168225] [2019-12-07 13:22:52,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:52,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:52,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646820950] [2019-12-07 13:22:52,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:52,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:52,370 INFO L87 Difference]: Start difference. First operand 833 states and 1244 transitions. Second operand 4 states. [2019-12-07 13:22:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:52,638 INFO L93 Difference]: Finished difference Result 1709 states and 2552 transitions. [2019-12-07 13:22:52,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:52,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 13:22:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:52,638 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 13:22:52,638 INFO L226 Difference]: Without dead ends: 895 [2019-12-07 13:22:52,639 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 13:22:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-07 13:22:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 835. [2019-12-07 13:22:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-07 13:22:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1246 transitions. [2019-12-07 13:22:52,659 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1246 transitions. Word has length 155 [2019-12-07 13:22:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:52,659 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1246 transitions. [2019-12-07 13:22:52,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1246 transitions. [2019-12-07 13:22:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 13:22:52,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:52,660 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:52,660 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -239800856, now seen corresponding path program 1 times [2019-12-07 13:22:52,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:52,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010587044] [2019-12-07 13:22:52,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:52,708 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 13:22:52,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010587044] [2019-12-07 13:22:52,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:52,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:52,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539735425] [2019-12-07 13:22:52,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:52,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:52,709 INFO L87 Difference]: Start difference. First operand 835 states and 1246 transitions. Second operand 4 states. [2019-12-07 13:22:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:53,007 INFO L93 Difference]: Finished difference Result 1741 states and 2590 transitions. [2019-12-07 13:22:53,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:53,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 13:22:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:53,008 INFO L225 Difference]: With dead ends: 1741 [2019-12-07 13:22:53,008 INFO L226 Difference]: Without dead ends: 925 [2019-12-07 13:22:53,009 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 13:22:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-12-07 13:22:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 835. [2019-12-07 13:22:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-07 13:22:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1244 transitions. [2019-12-07 13:22:53,040 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1244 transitions. Word has length 156 [2019-12-07 13:22:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:53,040 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1244 transitions. [2019-12-07 13:22:53,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1244 transitions. [2019-12-07 13:22:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 13:22:53,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:53,042 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:53,042 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1562462854, now seen corresponding path program 1 times [2019-12-07 13:22:53,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:53,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299904477] [2019-12-07 13:22:53,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:53,086 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 13:22:53,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299904477] [2019-12-07 13:22:53,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:53,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:53,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572221770] [2019-12-07 13:22:53,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:53,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:53,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:53,086 INFO L87 Difference]: Start difference. First operand 835 states and 1244 transitions. Second operand 4 states. [2019-12-07 13:22:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:53,350 INFO L93 Difference]: Finished difference Result 1735 states and 2578 transitions. [2019-12-07 13:22:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:53,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 13:22:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:53,351 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 13:22:53,351 INFO L226 Difference]: Without dead ends: 919 [2019-12-07 13:22:53,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 13:22:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-07 13:22:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 835. [2019-12-07 13:22:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-07 13:22:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1242 transitions. [2019-12-07 13:22:53,372 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1242 transitions. Word has length 156 [2019-12-07 13:22:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:53,372 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1242 transitions. [2019-12-07 13:22:53,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1242 transitions. [2019-12-07 13:22:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 13:22:53,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:53,374 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] [2019-12-07 13:22:53,374 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash 473382979, now seen corresponding path program 1 times [2019-12-07 13:22:53,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:53,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309229641] [2019-12-07 13:22:53,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:53,421 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 13:22:53,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309229641] [2019-12-07 13:22:53,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:53,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:53,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011310048] [2019-12-07 13:22:53,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:53,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:53,422 INFO L87 Difference]: Start difference. First operand 835 states and 1242 transitions. Second operand 4 states. [2019-12-07 13:22:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:53,714 INFO L93 Difference]: Finished difference Result 1785 states and 2670 transitions. [2019-12-07 13:22:53,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:53,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 13:22:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:53,715 INFO L225 Difference]: With dead ends: 1785 [2019-12-07 13:22:53,715 INFO L226 Difference]: Without dead ends: 969 [2019-12-07 13:22:53,716 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 13:22:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-12-07 13:22:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 895. [2019-12-07 13:22:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1348 transitions. [2019-12-07 13:22:53,737 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1348 transitions. Word has length 158 [2019-12-07 13:22:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:53,737 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1348 transitions. [2019-12-07 13:22:53,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1348 transitions. [2019-12-07 13:22:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 13:22:53,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:53,738 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:53,738 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1189357597, now seen corresponding path program 1 times [2019-12-07 13:22:53,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:53,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393541904] [2019-12-07 13:22:53,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:53,781 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 13:22:53,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393541904] [2019-12-07 13:22:53,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:53,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:53,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200659016] [2019-12-07 13:22:53,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:53,782 INFO L87 Difference]: Start difference. First operand 895 states and 1348 transitions. Second operand 4 states. [2019-12-07 13:22:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:54,058 INFO L93 Difference]: Finished difference Result 1855 states and 2786 transitions. [2019-12-07 13:22:54,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:54,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 13:22:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:54,059 INFO L225 Difference]: With dead ends: 1855 [2019-12-07 13:22:54,059 INFO L226 Difference]: Without dead ends: 979 [2019-12-07 13:22:54,059 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 13:22:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-12-07 13:22:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 895. [2019-12-07 13:22:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1346 transitions. [2019-12-07 13:22:54,081 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1346 transitions. Word has length 159 [2019-12-07 13:22:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:54,081 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1346 transitions. [2019-12-07 13:22:54,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1346 transitions. [2019-12-07 13:22:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 13:22:54,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:54,082 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:54,082 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1789548913, now seen corresponding path program 1 times [2019-12-07 13:22:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:54,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367599024] [2019-12-07 13:22:54,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:54,125 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 13:22:54,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367599024] [2019-12-07 13:22:54,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:54,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:54,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915713207] [2019-12-07 13:22:54,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:54,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:54,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:54,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:54,126 INFO L87 Difference]: Start difference. First operand 895 states and 1346 transitions. Second operand 4 states. [2019-12-07 13:22:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:54,401 INFO L93 Difference]: Finished difference Result 1843 states and 2766 transitions. [2019-12-07 13:22:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:54,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 13:22:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:54,403 INFO L225 Difference]: With dead ends: 1843 [2019-12-07 13:22:54,403 INFO L226 Difference]: Without dead ends: 967 [2019-12-07 13:22:54,403 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 13:22:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-12-07 13:22:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 895. [2019-12-07 13:22:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1344 transitions. [2019-12-07 13:22:54,425 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1344 transitions. Word has length 160 [2019-12-07 13:22:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:54,425 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1344 transitions. [2019-12-07 13:22:54,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1344 transitions. [2019-12-07 13:22:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 13:22:54,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:54,426 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:54,426 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash 873005811, now seen corresponding path program 1 times [2019-12-07 13:22:54,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:54,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584639396] [2019-12-07 13:22:54,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:54,470 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 13:22:54,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584639396] [2019-12-07 13:22:54,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:54,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:54,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544062583] [2019-12-07 13:22:54,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:54,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:54,471 INFO L87 Difference]: Start difference. First operand 895 states and 1344 transitions. Second operand 4 states. [2019-12-07 13:22:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:54,753 INFO L93 Difference]: Finished difference Result 1843 states and 2762 transitions. [2019-12-07 13:22:54,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:54,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 13:22:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:54,754 INFO L225 Difference]: With dead ends: 1843 [2019-12-07 13:22:54,755 INFO L226 Difference]: Without dead ends: 967 [2019-12-07 13:22:54,755 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 13:22:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-12-07 13:22:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 895. [2019-12-07 13:22:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1342 transitions. [2019-12-07 13:22:54,778 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1342 transitions. Word has length 160 [2019-12-07 13:22:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:54,778 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1342 transitions. [2019-12-07 13:22:54,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1342 transitions. [2019-12-07 13:22:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 13:22:54,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:54,780 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:54,780 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2012443003, now seen corresponding path program 1 times [2019-12-07 13:22:54,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:54,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111741431] [2019-12-07 13:22:54,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:54,823 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 13:22:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111741431] [2019-12-07 13:22:54,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:54,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:54,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413556525] [2019-12-07 13:22:54,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:54,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:54,824 INFO L87 Difference]: Start difference. First operand 895 states and 1342 transitions. Second operand 4 states. [2019-12-07 13:22:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:55,290 INFO L93 Difference]: Finished difference Result 1837 states and 2751 transitions. [2019-12-07 13:22:55,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:55,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 13:22:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:55,291 INFO L225 Difference]: With dead ends: 1837 [2019-12-07 13:22:55,291 INFO L226 Difference]: Without dead ends: 961 [2019-12-07 13:22:55,292 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 13:22:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-12-07 13:22:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 895. [2019-12-07 13:22:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1340 transitions. [2019-12-07 13:22:55,317 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1340 transitions. Word has length 161 [2019-12-07 13:22:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:55,317 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1340 transitions. [2019-12-07 13:22:55,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1340 transitions. [2019-12-07 13:22:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 13:22:55,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:55,319 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, 1, 1] [2019-12-07 13:22:55,319 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:55,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1084196335, now seen corresponding path program 1 times [2019-12-07 13:22:55,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:55,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603251565] [2019-12-07 13:22:55,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:55,361 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 13:22:55,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603251565] [2019-12-07 13:22:55,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:55,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:55,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056264675] [2019-12-07 13:22:55,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:55,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:55,362 INFO L87 Difference]: Start difference. First operand 895 states and 1340 transitions. Second operand 4 states. [2019-12-07 13:22:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:55,641 INFO L93 Difference]: Finished difference Result 1831 states and 2740 transitions. [2019-12-07 13:22:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:55,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 13:22:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:55,642 INFO L225 Difference]: With dead ends: 1831 [2019-12-07 13:22:55,642 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 13:22:55,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 13:22:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 13:22:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 895. [2019-12-07 13:22:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1338 transitions. [2019-12-07 13:22:55,664 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1338 transitions. Word has length 161 [2019-12-07 13:22:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:55,665 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1338 transitions. [2019-12-07 13:22:55,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1338 transitions. [2019-12-07 13:22:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 13:22:55,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:55,666 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, 1, 1] [2019-12-07 13:22:55,666 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1219098752, now seen corresponding path program 1 times [2019-12-07 13:22:55,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:55,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766606507] [2019-12-07 13:22:55,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:55,707 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 13:22:55,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766606507] [2019-12-07 13:22:55,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:55,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024446371] [2019-12-07 13:22:55,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:55,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:55,708 INFO L87 Difference]: Start difference. First operand 895 states and 1338 transitions. Second operand 4 states. [2019-12-07 13:22:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:56,041 INFO L93 Difference]: Finished difference Result 1821 states and 2726 transitions. [2019-12-07 13:22:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:56,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 13:22:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:56,043 INFO L225 Difference]: With dead ends: 1821 [2019-12-07 13:22:56,043 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 13:22:56,044 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 13:22:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 13:22:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 895. [2019-12-07 13:22:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1336 transitions. [2019-12-07 13:22:56,076 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1336 transitions. Word has length 161 [2019-12-07 13:22:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:56,076 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1336 transitions. [2019-12-07 13:22:56,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1336 transitions. [2019-12-07 13:22:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 13:22:56,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:56,077 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:56,077 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1414462085, now seen corresponding path program 1 times [2019-12-07 13:22:56,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:56,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845008336] [2019-12-07 13:22:56,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:56,122 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 13:22:56,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845008336] [2019-12-07 13:22:56,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:56,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:56,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663448106] [2019-12-07 13:22:56,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:56,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:56,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:56,123 INFO L87 Difference]: Start difference. First operand 895 states and 1336 transitions. Second operand 4 states. [2019-12-07 13:22:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:56,515 INFO L93 Difference]: Finished difference Result 1837 states and 2739 transitions. [2019-12-07 13:22:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:56,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 13:22:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:56,518 INFO L225 Difference]: With dead ends: 1837 [2019-12-07 13:22:56,519 INFO L226 Difference]: Without dead ends: 961 [2019-12-07 13:22:56,520 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 13:22:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-12-07 13:22:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 895. [2019-12-07 13:22:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1334 transitions. [2019-12-07 13:22:56,557 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1334 transitions. Word has length 162 [2019-12-07 13:22:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:56,557 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1334 transitions. [2019-12-07 13:22:56,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1334 transitions. [2019-12-07 13:22:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 13:22:56,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:56,558 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, 1, 1] [2019-12-07 13:22:56,558 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -541964910, now seen corresponding path program 1 times [2019-12-07 13:22:56,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:56,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655531448] [2019-12-07 13:22:56,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:56,601 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 13:22:56,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655531448] [2019-12-07 13:22:56,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:56,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:56,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400556326] [2019-12-07 13:22:56,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:56,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:56,602 INFO L87 Difference]: Start difference. First operand 895 states and 1334 transitions. Second operand 4 states. [2019-12-07 13:22:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:56,886 INFO L93 Difference]: Finished difference Result 1827 states and 2724 transitions. [2019-12-07 13:22:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:56,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 13:22:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:56,887 INFO L225 Difference]: With dead ends: 1827 [2019-12-07 13:22:56,887 INFO L226 Difference]: Without dead ends: 951 [2019-12-07 13:22:56,887 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 13:22:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-12-07 13:22:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 895. [2019-12-07 13:22:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1332 transitions. [2019-12-07 13:22:56,911 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1332 transitions. Word has length 162 [2019-12-07 13:22:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:56,911 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1332 transitions. [2019-12-07 13:22:56,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1332 transitions. [2019-12-07 13:22:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 13:22:56,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:56,912 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, 1, 1] [2019-12-07 13:22:56,912 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1949736729, now seen corresponding path program 1 times [2019-12-07 13:22:56,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:56,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136368789] [2019-12-07 13:22:56,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:56,953 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 13:22:56,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136368789] [2019-12-07 13:22:56,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:56,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:56,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824078197] [2019-12-07 13:22:56,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:56,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:56,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:56,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:56,953 INFO L87 Difference]: Start difference. First operand 895 states and 1332 transitions. Second operand 4 states. [2019-12-07 13:22:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:57,228 INFO L93 Difference]: Finished difference Result 1817 states and 2710 transitions. [2019-12-07 13:22:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:57,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 13:22:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:57,229 INFO L225 Difference]: With dead ends: 1817 [2019-12-07 13:22:57,229 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 13:22:57,229 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 13:22:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 13:22:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 895. [2019-12-07 13:22:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 13:22:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1330 transitions. [2019-12-07 13:22:57,254 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1330 transitions. Word has length 162 [2019-12-07 13:22:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:57,254 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1330 transitions. [2019-12-07 13:22:57,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1330 transitions. [2019-12-07 13:22:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 13:22:57,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:57,255 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:57,255 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash -524169235, now seen corresponding path program 1 times [2019-12-07 13:22:57,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:57,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156330644] [2019-12-07 13:22:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:57,300 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 13:22:57,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156330644] [2019-12-07 13:22:57,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:57,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:57,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433226286] [2019-12-07 13:22:57,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:57,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:57,301 INFO L87 Difference]: Start difference. First operand 895 states and 1330 transitions. Second operand 4 states. [2019-12-07 13:22:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:57,584 INFO L93 Difference]: Finished difference Result 1831 states and 2720 transitions. [2019-12-07 13:22:57,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:57,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 13:22:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:57,585 INFO L225 Difference]: With dead ends: 1831 [2019-12-07 13:22:57,585 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 13:22:57,585 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 13:22:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 13:22:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 881. [2019-12-07 13:22:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-12-07 13:22:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1314 transitions. [2019-12-07 13:22:57,608 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1314 transitions. Word has length 163 [2019-12-07 13:22:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:57,608 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1314 transitions. [2019-12-07 13:22:57,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1314 transitions. [2019-12-07 13:22:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 13:22:57,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:57,609 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, 1, 1, 1] [2019-12-07 13:22:57,609 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1590245114, now seen corresponding path program 1 times [2019-12-07 13:22:57,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:57,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511539038] [2019-12-07 13:22:57,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:57,696 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 13:22:57,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511539038] [2019-12-07 13:22:57,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:57,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:22:57,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746152435] [2019-12-07 13:22:57,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:22:57,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:22:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:22:57,697 INFO L87 Difference]: Start difference. First operand 881 states and 1314 transitions. Second operand 5 states. [2019-12-07 13:22:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:58,152 INFO L93 Difference]: Finished difference Result 1901 states and 2850 transitions. [2019-12-07 13:22:58,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:22:58,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-12-07 13:22:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:58,153 INFO L225 Difference]: With dead ends: 1901 [2019-12-07 13:22:58,154 INFO L226 Difference]: Without dead ends: 1039 [2019-12-07 13:22:58,154 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 13:22:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-12-07 13:22:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 947. [2019-12-07 13:22:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 13:22:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1432 transitions. [2019-12-07 13:22:58,179 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1432 transitions. Word has length 164 [2019-12-07 13:22:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:58,179 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1432 transitions. [2019-12-07 13:22:58,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:22:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1432 transitions. [2019-12-07 13:22:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 13:22:58,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:58,180 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, 1] [2019-12-07 13:22:58,180 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 363705902, now seen corresponding path program 1 times [2019-12-07 13:22:58,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:58,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497846598] [2019-12-07 13:22:58,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 13:22:58,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497846598] [2019-12-07 13:22:58,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:58,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:22:58,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295773142] [2019-12-07 13:22:58,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:22:58,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:22:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:22:58,226 INFO L87 Difference]: Start difference. First operand 947 states and 1432 transitions. Second operand 3 states. [2019-12-07 13:22:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:58,310 INFO L93 Difference]: Finished difference Result 2338 states and 3554 transitions. [2019-12-07 13:22:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:22:58,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-12-07 13:22:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:58,311 INFO L225 Difference]: With dead ends: 2338 [2019-12-07 13:22:58,311 INFO L226 Difference]: Without dead ends: 1410 [2019-12-07 13:22:58,311 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 13:22:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-12-07 13:22:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1403. [2019-12-07 13:22:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2019-12-07 13:22:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2121 transitions. [2019-12-07 13:22:58,349 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2121 transitions. Word has length 164 [2019-12-07 13:22:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:58,349 INFO L462 AbstractCegarLoop]: Abstraction has 1403 states and 2121 transitions. [2019-12-07 13:22:58,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:22:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2121 transitions. [2019-12-07 13:22:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 13:22:58,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:58,350 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, 1, 1] [2019-12-07 13:22:58,350 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1821420005, now seen corresponding path program 1 times [2019-12-07 13:22:58,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:58,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046815478] [2019-12-07 13:22:58,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:58,399 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 13:22:58,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046815478] [2019-12-07 13:22:58,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:58,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:58,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140718169] [2019-12-07 13:22:58,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:58,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:58,400 INFO L87 Difference]: Start difference. First operand 1403 states and 2121 transitions. Second operand 4 states. [2019-12-07 13:22:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:58,681 INFO L93 Difference]: Finished difference Result 2892 states and 4356 transitions. [2019-12-07 13:22:58,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:58,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 13:22:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:58,682 INFO L225 Difference]: With dead ends: 2892 [2019-12-07 13:22:58,682 INFO L226 Difference]: Without dead ends: 1508 [2019-12-07 13:22:58,683 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 13:22:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-12-07 13:22:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1439. [2019-12-07 13:22:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2019-12-07 13:22:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2163 transitions. [2019-12-07 13:22:58,721 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2163 transitions. Word has length 165 [2019-12-07 13:22:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:58,721 INFO L462 AbstractCegarLoop]: Abstraction has 1439 states and 2163 transitions. [2019-12-07 13:22:58,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2163 transitions. [2019-12-07 13:22:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 13:22:58,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:58,722 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, 1, 1, 1] [2019-12-07 13:22:58,722 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2127321731, now seen corresponding path program 1 times [2019-12-07 13:22:58,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:58,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336484048] [2019-12-07 13:22:58,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:58,786 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 13:22:58,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336484048] [2019-12-07 13:22:58,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:58,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:58,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164476860] [2019-12-07 13:22:58,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:58,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:58,787 INFO L87 Difference]: Start difference. First operand 1439 states and 2163 transitions. Second operand 4 states. [2019-12-07 13:22:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:59,099 INFO L93 Difference]: Finished difference Result 2910 states and 4373 transitions. [2019-12-07 13:22:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:59,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-12-07 13:22:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:59,100 INFO L225 Difference]: With dead ends: 2910 [2019-12-07 13:22:59,100 INFO L226 Difference]: Without dead ends: 1484 [2019-12-07 13:22:59,101 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 13:22:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2019-12-07 13:22:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1436. [2019-12-07 13:22:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-12-07 13:22:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2157 transitions. [2019-12-07 13:22:59,140 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2157 transitions. Word has length 166 [2019-12-07 13:22:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:59,140 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2157 transitions. [2019-12-07 13:22:59,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2157 transitions. [2019-12-07 13:22:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 13:22:59,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:59,141 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:59,142 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash -885832868, now seen corresponding path program 1 times [2019-12-07 13:22:59,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:59,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343084955] [2019-12-07 13:22:59,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:59,190 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 13:22:59,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343084955] [2019-12-07 13:22:59,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:59,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:59,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135206272] [2019-12-07 13:22:59,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:59,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:59,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:59,191 INFO L87 Difference]: Start difference. First operand 1436 states and 2157 transitions. Second operand 4 states. [2019-12-07 13:22:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:59,496 INFO L93 Difference]: Finished difference Result 2937 states and 4407 transitions. [2019-12-07 13:22:59,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:59,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-12-07 13:22:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:59,498 INFO L225 Difference]: With dead ends: 2937 [2019-12-07 13:22:59,498 INFO L226 Difference]: Without dead ends: 1520 [2019-12-07 13:22:59,499 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 13:22:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-12-07 13:22:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1436. [2019-12-07 13:22:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-12-07 13:22:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2154 transitions. [2019-12-07 13:22:59,539 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2154 transitions. Word has length 169 [2019-12-07 13:22:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:59,539 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2154 transitions. [2019-12-07 13:22:59,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2154 transitions. [2019-12-07 13:22:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 13:22:59,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:59,540 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, 1, 1, 1, 1, 1] [2019-12-07 13:22:59,540 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1483328059, now seen corresponding path program 1 times [2019-12-07 13:22:59,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:59,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381629953] [2019-12-07 13:22:59,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:59,586 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 13:22:59,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381629953] [2019-12-07 13:22:59,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:59,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:59,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655569933] [2019-12-07 13:22:59,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:59,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:59,587 INFO L87 Difference]: Start difference. First operand 1436 states and 2154 transitions. Second operand 4 states. [2019-12-07 13:22:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:59,907 INFO L93 Difference]: Finished difference Result 2931 states and 4395 transitions. [2019-12-07 13:22:59,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:59,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-12-07 13:22:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:59,910 INFO L225 Difference]: With dead ends: 2931 [2019-12-07 13:22:59,910 INFO L226 Difference]: Without dead ends: 1514 [2019-12-07 13:22:59,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 13:22:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-07 13:22:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1436. [2019-12-07 13:22:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-12-07 13:22:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2151 transitions. [2019-12-07 13:22:59,957 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2151 transitions. Word has length 170 [2019-12-07 13:22:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:59,957 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2151 transitions. [2019-12-07 13:22:59,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2151 transitions. [2019-12-07 13:22:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 13:22:59,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:59,959 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, 1, 1, 1, 1] [2019-12-07 13:22:59,959 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 165451016, now seen corresponding path program 1 times [2019-12-07 13:22:59,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:59,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840877838] [2019-12-07 13:22:59,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:23:00,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840877838] [2019-12-07 13:23:00,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105102967] [2019-12-07 13:23:00,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:00,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 13:23:00,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:00,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,349 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 13:23:00,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,374 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,376 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 13:23:00,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,406 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 13:23:00,406 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,441 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 13:23:00,442 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,475 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:00,476 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 13:23:00,476 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,485 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 13:23:00,486 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 13:23:00,517 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:00,517 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 13:23:00,518 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:00,556 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:00,557 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 13:23:00,557 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,563 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:00,566 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 13:23:00,569 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 13:23:00,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,613 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:23:00,613 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 13:23:00,614 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,621 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:23:00,645 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:00,645 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 13:23:00,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:00,672 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:00,673 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 13:23:00,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:00,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:00,684 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 13:23:00,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:00,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 13:23:00,688 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:00,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:00,813 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 13:23:00,814 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 13:23:00,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-12-07 13:23:00,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:01,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:01,150 INFO L534 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-12-07 13:23:03,237 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-12-07 13:23:03,239 INFO L614 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-12-07 13:23:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:03,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 13:23:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:03,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:03,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-12-07 13:23:03,270 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-12-07 13:23:06,091 WARN L192 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-12-07 13:23:06,097 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 13:23:06,099 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 13:23:06,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:06,256 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 13:23:06,257 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 13:23:06,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-12-07 13:23:06,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,258 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:06,282 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 13:23:06,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:06,283 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 13:23:06,304 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 13:23:06,307 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 13:23:06,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:06,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:06,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,465 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 13:23:06,465 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 13:23:06,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-12-07 13:23:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:06,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,470 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:06,601 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2019-12-07 13:23:06,601 INFO L614 ElimStorePlain]: treesize reduction 7769, result has 1.1 percent of original size [2019-12-07 13:23:06,601 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:06,602 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 13:23:06,627 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 13:23:06,629 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 31 treesize of output 25 [2019-12-07 13:23:06,630 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 13:23:06,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:06,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-12-07 13:23:06,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:06,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:06,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:06,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:06,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-12-07 13:23:06,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:06,756 INFO L534 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 16 xjuncts. [2019-12-07 13:23:09,147 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 1002 [2019-12-07 13:23:09,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:09,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 13:23:09,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:23:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 13:23:09,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 13:23:09,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 13:23:09,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:09,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 13:23:09,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 13:23:09,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 13:23:09,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:09,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:23:09,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:09,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:09,184 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1761 [2019-12-07 13:23:09,987 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 1263 DAG size of output: 22 [2019-12-07 13:23:10,000 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:23:10,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 13:23:10,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:10,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:10,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:23:10,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 13:23:10,041 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:23:10,041 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 13:23:10,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:10,044 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:10,045 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 13:23:10,045 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 13:23:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:23:10,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:23:10,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-12-07 13:23:10,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330262745] [2019-12-07 13:23:10,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:23:10,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:23:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:23:10,267 INFO L87 Difference]: Start difference. First operand 1436 states and 2151 transitions. Second operand 13 states. [2019-12-07 13:23:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:13,309 INFO L93 Difference]: Finished difference Result 5416 states and 8069 transitions. [2019-12-07 13:23:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:23:13,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-12-07 13:23:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:13,317 INFO L225 Difference]: With dead ends: 5416 [2019-12-07 13:23:13,317 INFO L226 Difference]: Without dead ends: 3999 [2019-12-07 13:23:13,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:23:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2019-12-07 13:23:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 2687. [2019-12-07 13:23:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-12-07 13:23:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4022 transitions. [2019-12-07 13:23:13,427 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4022 transitions. Word has length 173 [2019-12-07 13:23:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:13,427 INFO L462 AbstractCegarLoop]: Abstraction has 2687 states and 4022 transitions. [2019-12-07 13:23:13,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:23:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4022 transitions. [2019-12-07 13:23:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 13:23:13,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:13,429 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] [2019-12-07 13:23:13,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:23:13,630 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:13,630 INFO L82 PathProgramCache]: Analyzing trace with hash 931660317, now seen corresponding path program 1 times [2019-12-07 13:23:13,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:13,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685840620] [2019-12-07 13:23:13,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:13,676 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 13:23:13,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685840620] [2019-12-07 13:23:13,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:13,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:13,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825807200] [2019-12-07 13:23:13,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:13,677 INFO L87 Difference]: Start difference. First operand 2687 states and 4022 transitions. Second operand 4 states. [2019-12-07 13:23:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:14,072 INFO L93 Difference]: Finished difference Result 4296 states and 6415 transitions. [2019-12-07 13:23:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:14,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 13:23:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:14,075 INFO L225 Difference]: With dead ends: 4296 [2019-12-07 13:23:14,075 INFO L226 Difference]: Without dead ends: 2879 [2019-12-07 13:23:14,076 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 13:23:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2019-12-07 13:23:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2687. [2019-12-07 13:23:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-12-07 13:23:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4016 transitions. [2019-12-07 13:23:14,181 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4016 transitions. Word has length 173 [2019-12-07 13:23:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:14,181 INFO L462 AbstractCegarLoop]: Abstraction has 2687 states and 4016 transitions. [2019-12-07 13:23:14,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4016 transitions. [2019-12-07 13:23:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 13:23:14,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:14,183 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, 1, 1] [2019-12-07 13:23:14,183 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1170651140, now seen corresponding path program 1 times [2019-12-07 13:23:14,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:14,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097070605] [2019-12-07 13:23:14,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:14,227 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 13:23:14,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097070605] [2019-12-07 13:23:14,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:14,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:14,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363353556] [2019-12-07 13:23:14,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:14,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:14,228 INFO L87 Difference]: Start difference. First operand 2687 states and 4016 transitions. Second operand 4 states. [2019-12-07 13:23:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:14,717 INFO L93 Difference]: Finished difference Result 4296 states and 6406 transitions. [2019-12-07 13:23:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:14,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-12-07 13:23:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:14,720 INFO L225 Difference]: With dead ends: 4296 [2019-12-07 13:23:14,721 INFO L226 Difference]: Without dead ends: 2879 [2019-12-07 13:23:14,721 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 13:23:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2019-12-07 13:23:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2687. [2019-12-07 13:23:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-12-07 13:23:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4010 transitions. [2019-12-07 13:23:14,809 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4010 transitions. Word has length 174 [2019-12-07 13:23:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:14,810 INFO L462 AbstractCegarLoop]: Abstraction has 2687 states and 4010 transitions. [2019-12-07 13:23:14,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4010 transitions. [2019-12-07 13:23:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 13:23:14,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:14,811 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, 1, 1] [2019-12-07 13:23:14,811 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash -49364734, now seen corresponding path program 1 times [2019-12-07 13:23:14,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:14,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130455489] [2019-12-07 13:23:14,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:14,859 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 13:23:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130455489] [2019-12-07 13:23:14,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:14,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:14,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307591914] [2019-12-07 13:23:14,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:14,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:14,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:14,860 INFO L87 Difference]: Start difference. First operand 2687 states and 4010 transitions. Second operand 4 states. [2019-12-07 13:23:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:15,238 INFO L93 Difference]: Finished difference Result 4296 states and 6397 transitions. [2019-12-07 13:23:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:15,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-12-07 13:23:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:15,242 INFO L225 Difference]: With dead ends: 4296 [2019-12-07 13:23:15,242 INFO L226 Difference]: Without dead ends: 2879 [2019-12-07 13:23:15,243 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 13:23:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2019-12-07 13:23:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2687. [2019-12-07 13:23:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-12-07 13:23:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4004 transitions. [2019-12-07 13:23:15,329 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4004 transitions. Word has length 175 [2019-12-07 13:23:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:15,329 INFO L462 AbstractCegarLoop]: Abstraction has 2687 states and 4004 transitions. [2019-12-07 13:23:15,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4004 transitions. [2019-12-07 13:23:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 13:23:15,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:15,330 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, 1, 1] [2019-12-07 13:23:15,331 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash 746052041, now seen corresponding path program 1 times [2019-12-07 13:23:15,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:15,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319529489] [2019-12-07 13:23:15,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:15,376 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 13:23:15,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319529489] [2019-12-07 13:23:15,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:15,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:15,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895507627] [2019-12-07 13:23:15,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:15,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:15,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:15,377 INFO L87 Difference]: Start difference. First operand 2687 states and 4004 transitions. Second operand 4 states. [2019-12-07 13:23:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:15,778 INFO L93 Difference]: Finished difference Result 4266 states and 6352 transitions. [2019-12-07 13:23:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:15,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-12-07 13:23:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:15,780 INFO L225 Difference]: With dead ends: 4266 [2019-12-07 13:23:15,780 INFO L226 Difference]: Without dead ends: 2849 [2019-12-07 13:23:15,781 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 13:23:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2019-12-07 13:23:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2687. [2019-12-07 13:23:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-12-07 13:23:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3998 transitions. [2019-12-07 13:23:15,868 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3998 transitions. Word has length 176 [2019-12-07 13:23:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:15,868 INFO L462 AbstractCegarLoop]: Abstraction has 2687 states and 3998 transitions. [2019-12-07 13:23:15,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3998 transitions. [2019-12-07 13:23:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 13:23:15,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:15,870 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, 1, 1] [2019-12-07 13:23:15,870 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2069660934, now seen corresponding path program 1 times [2019-12-07 13:23:15,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:15,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165384285] [2019-12-07 13:23:15,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:15,955 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 13:23:15,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165384285] [2019-12-07 13:23:15,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:15,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:23:15,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155831136] [2019-12-07 13:23:15,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:23:15,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:15,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:23:15,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:23:15,956 INFO L87 Difference]: Start difference. First operand 2687 states and 3998 transitions. Second operand 5 states. [2019-12-07 13:23:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:16,471 INFO L93 Difference]: Finished difference Result 6150 states and 9223 transitions. [2019-12-07 13:23:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:16,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-12-07 13:23:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:16,473 INFO L225 Difference]: With dead ends: 6150 [2019-12-07 13:23:16,473 INFO L226 Difference]: Without dead ends: 3482 [2019-12-07 13:23:16,474 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 13:23:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-12-07 13:23:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 2924. [2019-12-07 13:23:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-12-07 13:23:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4427 transitions. [2019-12-07 13:23:16,566 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4427 transitions. Word has length 179 [2019-12-07 13:23:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:16,566 INFO L462 AbstractCegarLoop]: Abstraction has 2924 states and 4427 transitions. [2019-12-07 13:23:16,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:23:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4427 transitions. [2019-12-07 13:23:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 13:23:16,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:16,567 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, 1, 1, 1] [2019-12-07 13:23:16,568 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:16,568 INFO L82 PathProgramCache]: Analyzing trace with hash 406872458, now seen corresponding path program 1 times [2019-12-07 13:23:16,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:16,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662628361] [2019-12-07 13:23:16,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:16,642 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 13:23:16,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662628361] [2019-12-07 13:23:16,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:16,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:23:16,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760652334] [2019-12-07 13:23:16,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:23:16,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:23:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:23:16,643 INFO L87 Difference]: Start difference. First operand 2924 states and 4427 transitions. Second operand 5 states. [2019-12-07 13:23:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:17,119 INFO L93 Difference]: Finished difference Result 6456 states and 9808 transitions. [2019-12-07 13:23:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:17,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-12-07 13:23:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:17,122 INFO L225 Difference]: With dead ends: 6456 [2019-12-07 13:23:17,122 INFO L226 Difference]: Without dead ends: 3551 [2019-12-07 13:23:17,123 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 13:23:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2019-12-07 13:23:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3086. [2019-12-07 13:23:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3086 states. [2019-12-07 13:23:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4757 transitions. [2019-12-07 13:23:17,225 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4757 transitions. Word has length 180 [2019-12-07 13:23:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:17,225 INFO L462 AbstractCegarLoop]: Abstraction has 3086 states and 4757 transitions. [2019-12-07 13:23:17,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:23:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4757 transitions. [2019-12-07 13:23:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:23:17,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:17,227 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, 1, 1, 1] [2019-12-07 13:23:17,227 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1106098171, now seen corresponding path program 1 times [2019-12-07 13:23:17,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:17,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326263061] [2019-12-07 13:23:17,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:17,433 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 13:23:17,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326263061] [2019-12-07 13:23:17,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463811789] [2019-12-07 13:23:17,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:17,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 13:23:17,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:17,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,588 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 13:23:17,589 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,623 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-12-07 13:23:17,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,647 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 13:23:17,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:17,675 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 13:23:17,675 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,707 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:17,707 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 13:23:17,708 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,716 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 13:23:17,716 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 13:23:17,746 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:17,746 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 13:23:17,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:17,772 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:17,773 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 13:23:17,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,778 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:17,779 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-12-07 13:23:17,781 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 13:23:17,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,828 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:23:17,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, 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 13:23:17,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:23:17,858 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:17,859 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 13:23:17,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:17,884 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:17,884 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 13:23:17,885 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,890 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:17,894 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 12=[|v_#memory_$Pointer$.base_183|]} [2019-12-07 13:23:17,895 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 13:23:17,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,941 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:23:17,941 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 13:23:17,941 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,948 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:23:17,952 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_181|], 2=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_184|]} [2019-12-07 13:23:17,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 13:23:17,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,970 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:17,972 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 120 treesize of output 92 [2019-12-07 13:23:17,973 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:17,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:18,059 INFO L343 Elim1Store]: treesize reduction 36, result has 84.9 percent of original size [2019-12-07 13:23:18,059 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 123 treesize of output 263 [2019-12-07 13:23:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:18,063 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:18,141 INFO L614 ElimStorePlain]: treesize reduction 1074, result has 6.4 percent of original size [2019-12-07 13:23:18,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:18,141 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:182, output treesize:74 [2019-12-07 13:23:18,160 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 43 treesize of output 31 [2019-12-07 13:23:18,160 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 13:23:18,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:18,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-12-07 13:23:18,171 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:18,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:18,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:18,178 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:56 [2019-12-07 13:23:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 13:23:18,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:23:18,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 13:23:18,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515533247] [2019-12-07 13:23:18,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:23:18,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:23:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:23:18,291 INFO L87 Difference]: Start difference. First operand 3086 states and 4757 transitions. Second operand 5 states. [2019-12-07 13:23:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:19,269 INFO L93 Difference]: Finished difference Result 7718 states and 11855 transitions. [2019-12-07 13:23:19,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:23:19,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-12-07 13:23:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:19,272 INFO L225 Difference]: With dead ends: 7718 [2019-12-07 13:23:19,272 INFO L226 Difference]: Without dead ends: 4651 [2019-12-07 13:23:19,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:23:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2019-12-07 13:23:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 3092. [2019-12-07 13:23:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-12-07 13:23:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4763 transitions. [2019-12-07 13:23:19,373 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4763 transitions. Word has length 193 [2019-12-07 13:23:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:19,373 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4763 transitions. [2019-12-07 13:23:19,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:23:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4763 transitions. [2019-12-07 13:23:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:23:19,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:19,375 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, 1, 1, 1] [2019-12-07 13:23:19,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:23:19,576 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 482816569, now seen corresponding path program 1 times [2019-12-07 13:23:19,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:19,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361645387] [2019-12-07 13:23:19,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:19,797 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 13:23:19,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361645387] [2019-12-07 13:23:19,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547650413] [2019-12-07 13:23:19,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:19,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 13:23:19,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:19,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:19,985 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 13:23:19,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,024 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_192|], 2=[|v_#memory_$Pointer$.base_186|, |v_#memory_$Pointer$.base_185|]} [2019-12-07 13:23:20,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,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 13:23:20,049 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,077 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 13:23:20,077 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,109 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:20,109 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 13:23:20,110 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,119 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 13:23:20,119 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 13:23:20,149 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:20,149 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 13:23:20,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:20,176 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:20,177 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 13:23:20,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:20,184 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 12=[|v_#memory_$Pointer$.base_195|]} [2019-12-07 13:23:20,186 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 13:23:20,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,233 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:23:20,233 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 13:23:20,233 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,240 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:23:20,261 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:20,262 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 13:23:20,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:20,295 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:23:20,295 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 13:23:20,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:23:20,305 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_188|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-12-07 13:23:20,307 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 13:23:20,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,352 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:23:20,352 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 13:23:20,352 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,360 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:23:20,362 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 13:23:20,365 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 13:23:20,365 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 13:23:20,374 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,441 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 13:23:20,442 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 13:23:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,461 INFO L614 ElimStorePlain]: treesize reduction 139, result has 27.6 percent of original size [2019-12-07 13:23:20,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,461 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 13:23:20,464 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_189|], 12=[|v_#memory_$Pointer$.base_200|]} [2019-12-07 13:23:20,466 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 13:23:20,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,511 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:23:20,511 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 13:23:20,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,519 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:23:20,522 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_201|]} [2019-12-07 13:23:20,524 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 13:23:20,524 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 13:23:20,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,602 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 13:23:20,602 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 13:23:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:23:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,607 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 13:23:20,658 INFO L614 ElimStorePlain]: treesize reduction 619, result has 7.9 percent of original size [2019-12-07 13:23:20,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,658 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 13:23:20,661 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_191|, |v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_190|], 12=[|v_#memory_$Pointer$.base_202|]} [2019-12-07 13:23:20,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,670 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 13:23:20,670 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,720 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 13:23:20,720 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,758 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 13:23:20,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,799 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 13:23:20,799 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,828 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 13:23:20,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,858 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 13:23:20,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,870 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 13:23:20,871 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:20,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:20,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:20,984 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 13:23:20,984 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 13:23:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:23:20,986 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:21,011 INFO L614 ElimStorePlain]: treesize reduction 48, result has 68.4 percent of original size [2019-12-07 13:23:21,012 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 13:23:21,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:21,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:21,027 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 13:23:21,062 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 6=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_int_183|]} [2019-12-07 13:23:21,066 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 13:23:21,067 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 13:23:21,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:21,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:21,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:21,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:23:21,099 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 13:23:21,099 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 13:23:21,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:21,122 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 13:23:21,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, 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 13:23:21,123 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:21,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:21,130 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 13:23:21,130 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-12-07 13:23:21,386 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 13:23:21,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:23:21,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 13:23:21,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347843855] [2019-12-07 13:23:21,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:23:21,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:23:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:23:21,387 INFO L87 Difference]: Start difference. First operand 3092 states and 4763 transitions. Second operand 10 states. [2019-12-07 13:23:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:24,255 INFO L93 Difference]: Finished difference Result 8390 states and 12822 transitions. [2019-12-07 13:23:24,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:23:24,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2019-12-07 13:23:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:24,260 INFO L225 Difference]: With dead ends: 8390 [2019-12-07 13:23:24,261 INFO L226 Difference]: Without dead ends: 5317 [2019-12-07 13:23:24,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:23:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2019-12-07 13:23:24,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 3560. [2019-12-07 13:23:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-12-07 13:23:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5589 transitions. [2019-12-07 13:23:24,381 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5589 transitions. Word has length 193 [2019-12-07 13:23:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:24,381 INFO L462 AbstractCegarLoop]: Abstraction has 3560 states and 5589 transitions. [2019-12-07 13:23:24,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:23:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5589 transitions. [2019-12-07 13:23:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-07 13:23:24,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:24,383 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] [2019-12-07 13:23:24,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:23:24,584 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1510111414, now seen corresponding path program 1 times [2019-12-07 13:23:24,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:24,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196083730] [2019-12-07 13:23:24,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:24,656 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 13:23:24,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196083730] [2019-12-07 13:23:24,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:24,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:24,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653608382] [2019-12-07 13:23:24,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:24,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:24,657 INFO L87 Difference]: Start difference. First operand 3560 states and 5589 transitions. Second operand 4 states. [2019-12-07 13:23:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:25,065 INFO L93 Difference]: Finished difference Result 7263 states and 11384 transitions. [2019-12-07 13:23:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:25,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-12-07 13:23:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:25,068 INFO L225 Difference]: With dead ends: 7263 [2019-12-07 13:23:25,068 INFO L226 Difference]: Without dead ends: 3722 [2019-12-07 13:23:25,070 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 13:23:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-12-07 13:23:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3560. [2019-12-07 13:23:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-12-07 13:23:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5583 transitions. [2019-12-07 13:23:25,179 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5583 transitions. Word has length 200 [2019-12-07 13:23:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:25,179 INFO L462 AbstractCegarLoop]: Abstraction has 3560 states and 5583 transitions. [2019-12-07 13:23:25,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5583 transitions. [2019-12-07 13:23:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-07 13:23:25,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:25,181 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] [2019-12-07 13:23:25,181 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1115664385, now seen corresponding path program 1 times [2019-12-07 13:23:25,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:25,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930825026] [2019-12-07 13:23:25,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:25,238 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 13:23:25,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930825026] [2019-12-07 13:23:25,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:25,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:25,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784128191] [2019-12-07 13:23:25,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:25,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:23:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:25,239 INFO L87 Difference]: Start difference. First operand 3560 states and 5583 transitions. Second operand 4 states. [2019-12-07 13:23:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:25,649 INFO L93 Difference]: Finished difference Result 7251 states and 11360 transitions. [2019-12-07 13:23:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:25,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-12-07 13:23:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:25,652 INFO L225 Difference]: With dead ends: 7251 [2019-12-07 13:23:25,652 INFO L226 Difference]: Without dead ends: 3710 [2019-12-07 13:23:25,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 13:23:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2019-12-07 13:23:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3560. [2019-12-07 13:23:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-12-07 13:23:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5577 transitions. [2019-12-07 13:23:25,759 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5577 transitions. Word has length 201 [2019-12-07 13:23:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:25,759 INFO L462 AbstractCegarLoop]: Abstraction has 3560 states and 5577 transitions. [2019-12-07 13:23:25,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5577 transitions. [2019-12-07 13:23:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-12-07 13:23:25,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:25,762 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:23:25,762 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:25,762 INFO L82 PathProgramCache]: Analyzing trace with hash 293913401, now seen corresponding path program 1 times [2019-12-07 13:23:25,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:23:25,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339673341] [2019-12-07 13:23:25,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:23:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:23:25,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:23:25,909 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:23:26,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:23:26 BoogieIcfgContainer [2019-12-07 13:23:26,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:23:26,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:23:26,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:23:26,009 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:23:26,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:22" (3/4) ... [2019-12-07 13:23:26,012 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:23:26,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:23:26,012 INFO L168 Benchmark]: Toolchain (without parser) took 64289.35 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.8 MB). Free memory was 942.4 MB in the beginning and 1.2 GB in the end (delta: -280.9 MB). Peak memory consumption was 169.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:23:26,013 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:23:26,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:23:26,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:23:26,013 INFO L168 Benchmark]: Boogie Preprocessor took 55.60 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:23:26,013 INFO L168 Benchmark]: RCFGBuilder took 680.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.6 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:23:26,014 INFO L168 Benchmark]: TraceAbstraction took 63086.69 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 320.3 MB). Free memory was 989.6 MB in the beginning and 1.2 GB in the end (delta: -245.9 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:23:26,014 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:23:26,015 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.60 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 680.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.6 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63086.69 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 320.3 MB). Free memory was 989.6 MB in the beginning and 1.2 GB in the end (delta: -245.9 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1774]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1602] EXPR s->session [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.new_cipher [L1602] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1613] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1616] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={6:0}] [L1619] COND FALSE !(blastFlag == 19) VAL [init=1, SSLv3_server_data={6:0}] [L1627] COND FALSE !(ret <= 0) [L1632] s->state = 8672 [L1633] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1634] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1643] ret = __VERIFIER_nondet_int() [L1644] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1647] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1650] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={6:0}] [L1653] COND FALSE !(blastFlag == 20) VAL [init=1, SSLv3_server_data={6:0}] [L1661] COND FALSE !(ret <= 0) [L1666] s->state = 8448 [L1667] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND TRUE s->hit [L1668] EXPR s->s3 [L1668] (s->s3)->tmp.next_state = 8640 [L1672] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={6:0}] [L1577] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={6:0}] [L1580] COND FALSE !(blastFlag == 18) VAL [init=1, SSLv3_server_data={6:0}] [L1774] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 159 locations, 1 error locations. Result: UNSAFE, OverallTime: 62.9s, OverallIterations: 123, TraceHistogramMax: 8, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 29488 SDtfs, 10614 SDslu, 47313 SDs, 0 SdLazy, 28469 SolverSat, 1526 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1259 GetRequests, 817 SyntacticMatches, 45 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3560occurred in iteration=120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 122 MinimizatonAttempts, 13297 StatesRemovedByMinimization, 122 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 16114 NumberOfCodeBlocks, 16114 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 15787 ConstructedInterpolants, 114 QuantifiedInterpolants, 10393852 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2009 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 125 InterpolantComputations, 120 PerfectInterpolantSequences, 17375/18153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 13:23:27,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:23:27,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:23:27,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:23:27,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:23:27,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:23:27,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:23:27,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:23:27,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:23:27,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:23:27,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:23:27,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:23:27,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:23:27,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:23:27,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:23:27,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:23:27,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:23:27,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:23:27,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:23:27,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:23:27,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:23:27,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:23:27,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:23:27,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:23:27,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:23:27,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:23:27,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:23:27,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:23:27,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:23:27,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:23:27,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:23:27,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:23:27,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:23:27,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:23:27,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:23:27,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:23:27,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:23:27,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:23:27,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:23:27,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:23:27,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:23:27,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 13:23:27,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:23:27,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:23:27,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:23:27,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:23:27,358 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:23:27,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:23:27,358 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:23:27,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:23:27,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:23:27,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:23:27,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:23:27,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:23:27,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:23:27,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:23:27,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:23:27,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:23:27,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:23:27,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:23:27,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:23:27,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:23:27,361 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 13:23:27,361 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:23:27,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:23:27,361 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:23:27,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:23:27,361 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_29713911-e023-4614-9be3-855ec32ff89b/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 -> 1e5c16342ed8a3195ac47e6b0aa4f5bd61af737f [2019-12-07 13:23:27,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:23:27,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:23:27,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:23:27,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:23:27,552 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:23:27,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.c [2019-12-07 13:23:27,597 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/d34ae9140/bbe622eddc72430c83e69e61b92ff4c1/FLAG790f66c67 [2019-12-07 13:23:28,010 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:23:28,011 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-1.c [2019-12-07 13:23:28,024 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/d34ae9140/bbe622eddc72430c83e69e61b92ff4c1/FLAG790f66c67 [2019-12-07 13:23:28,032 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/bin/uautomizer/data/d34ae9140/bbe622eddc72430c83e69e61b92ff4c1 [2019-12-07 13:23:28,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:23:28,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:23:28,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:23:28,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:23:28,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:23:28,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10831c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28, skipping insertion in model container [2019-12-07 13:23:28,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:23:28,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:23:28,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:23:28,411 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:23:28,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:23:28,511 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:23:28,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28 WrapperNode [2019-12-07 13:23:28,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:23:28,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:23:28,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:23:28,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:23:28,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:23:28,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:23:28,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:23:28,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:23:28,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... [2019-12-07 13:23:28,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:23:28,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:23:28,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:23:28,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:23:28,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:23:28,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:23:28,831 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:23:30,314 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 13:23:30,314 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 13:23:30,315 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:23:30,315 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:23:30,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:23:30 BoogieIcfgContainer [2019-12-07 13:23:30,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:23:30,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:23:30,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:23:30,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:23:30,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:23:28" (1/3) ... [2019-12-07 13:23:30,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496da25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:23:30, skipping insertion in model container [2019-12-07 13:23:30,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:28" (2/3) ... [2019-12-07 13:23:30,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496da25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:23:30, skipping insertion in model container [2019-12-07 13:23:30,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:23:30" (3/3) ... [2019-12-07 13:23:30,321 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2019-12-07 13:23:30,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:23:30,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:23:30,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:23:30,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:23:30,363 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:23:30,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:23:30,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:23:30,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:23:30,363 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:23:30,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:23:30,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:23:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-12-07 13:23:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:23:30,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:30,384 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, 1, 1] [2019-12-07 13:23:30,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889119, now seen corresponding path program 1 times [2019-12-07 13:23:30,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:23:30,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718464598] [2019-12-07 13:23:30,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:30,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:23:30,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:30,616 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:23:30,617 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 13:23:30,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:30,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:30,628 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 13:23:30,629 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:23:30,661 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:23:30,662 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 13:23:30,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:30,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:30,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:30,668 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:23:30,674 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 13:23:30,675 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:30,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:30,677 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 13:23:30,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:23:30,690 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 13:23:30,690 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:23:30,706 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 13:23:30,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718464598] [2019-12-07 13:23:30,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:30,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 13:23:30,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738527364] [2019-12-07 13:23:30,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:30,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:23:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:30,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:30,722 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2019-12-07 13:23:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:33,756 INFO L93 Difference]: Finished difference Result 345 states and 591 transitions. [2019-12-07 13:23:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:33,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 13:23:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:33,768 INFO L225 Difference]: With dead ends: 345 [2019-12-07 13:23:33,768 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 13:23:33,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 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 13:23:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 13:23:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-12-07 13:23:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:23:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-12-07 13:23:33,809 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 44 [2019-12-07 13:23:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:33,809 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-12-07 13:23:33,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-12-07 13:23:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:23:33,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:33,812 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, 1, 1] [2019-12-07 13:23:34,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:23:34,014 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -829622597, now seen corresponding path program 1 times [2019-12-07 13:23:34,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:23:34,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494943887] [2019-12-07 13:23:34,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:34,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:23:34,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:34,217 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:23:34,218 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 13:23:34,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:34,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:34,227 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 13:23:34,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:23:34,248 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:23:34,249 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 13:23:34,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:34,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:34,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:34,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:23:34,257 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 13:23:34,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:34,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:34,259 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 13:23:34,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:23:34,271 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 13:23:34,271 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:23:34,304 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 13:23:34,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494943887] [2019-12-07 13:23:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:23:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399983948] [2019-12-07 13:23:34,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:23:34,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:23:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:23:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:23:34,307 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 6 states. [2019-12-07 13:23:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:42,292 INFO L93 Difference]: Finished difference Result 439 states and 689 transitions. [2019-12-07 13:23:42,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:23:42,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 13:23:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:42,295 INFO L225 Difference]: With dead ends: 439 [2019-12-07 13:23:42,295 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 13:23:42,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 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 13:23:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 13:23:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 173. [2019-12-07 13:23:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 13:23:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2019-12-07 13:23:42,310 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 57 [2019-12-07 13:23:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:42,310 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2019-12-07 13:23:42,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:23:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2019-12-07 13:23:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:23:42,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:42,313 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, 1, 1] [2019-12-07 13:23:42,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:23:42,514 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -44447127, now seen corresponding path program 1 times [2019-12-07 13:23:42,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:23:42,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965079544] [2019-12-07 13:23:42,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:42,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:23:42,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:42,647 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 13:23:42,649 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 13:23:42,650 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 13:23:42,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:42,660 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 13:23:42,661 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 13:23:42,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:42,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:42,710 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 13:23:42,710 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:50,814 WARN L192 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 13:23:50,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:50,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:50,815 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 13:23:50,826 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 13:23:50,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:50,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:50,828 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 13:23:50,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:23:50,836 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 13:23:50,836 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:23:50,843 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 13:23:50,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965079544] [2019-12-07 13:23:50,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:50,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 13:23:50,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399497738] [2019-12-07 13:23:50,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:50,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:23:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:50,845 INFO L87 Difference]: Start difference. First operand 173 states and 273 transitions. Second operand 4 states. [2019-12-07 13:23:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:54,225 INFO L93 Difference]: Finished difference Result 356 states and 560 transitions. [2019-12-07 13:23:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:54,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:23:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:54,227 INFO L225 Difference]: With dead ends: 356 [2019-12-07 13:23:54,228 INFO L226 Difference]: Without dead ends: 202 [2019-12-07 13:23:54,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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 13:23:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-07 13:23:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-12-07 13:23:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-12-07 13:23:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2019-12-07 13:23:54,236 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 58 [2019-12-07 13:23:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:54,237 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2019-12-07 13:23:54,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2019-12-07 13:23:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:23:54,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:54,238 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, 1, 1] [2019-12-07 13:23:54,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:23:54,439 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1118306, now seen corresponding path program 1 times [2019-12-07 13:23:54,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:23:54,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64769336] [2019-12-07 13:23:54,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:23:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:54,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:23:54,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:23:54,629 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:23:54,629 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 13:23:54,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:54,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:54,640 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 13:23:54,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:23:54,666 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:23:54,666 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 13:23:54,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:54,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:54,670 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:23:54,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:23:54,675 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 13:23:54,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:23:54,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:23:54,678 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 13:23:54,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:23:54,688 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 13:23:54,688 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:23:54,719 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 13:23:54,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64769336] [2019-12-07 13:23:54,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:54,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:23:54,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82052107] [2019-12-07 13:23:54,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:23:54,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:23:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:23:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:23:54,720 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand 6 states. [2019-12-07 13:24:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:01,455 INFO L93 Difference]: Finished difference Result 485 states and 763 transitions. [2019-12-07 13:24:01,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:01,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 13:24:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:01,457 INFO L225 Difference]: With dead ends: 485 [2019-12-07 13:24:01,457 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 13:24:01,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 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 13:24:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 13:24:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 190. [2019-12-07 13:24:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 13:24:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 299 transitions. [2019-12-07 13:24:01,464 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 299 transitions. Word has length 58 [2019-12-07 13:24:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:01,464 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 299 transitions. [2019-12-07 13:24:01,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 299 transitions. [2019-12-07 13:24:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:24:01,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:01,465 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, 1] [2019-12-07 13:24:01,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:24:01,666 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:01,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1969168478, now seen corresponding path program 1 times [2019-12-07 13:24:01,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:01,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951228723] [2019-12-07 13:24:01,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:01,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:24:01,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:01,785 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 13:24:01,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:01,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:01,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:01,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:24:01,797 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 13:24:01,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:01,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:01,799 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 13:24:01,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:24:01,808 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 13:24:01,808 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:01,828 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 13:24:01,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951228723] [2019-12-07 13:24:01,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:01,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:01,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250777726] [2019-12-07 13:24:01,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:01,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:01,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:01,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:01,830 INFO L87 Difference]: Start difference. First operand 190 states and 299 transitions. Second operand 6 states. [2019-12-07 13:24:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:08,428 INFO L93 Difference]: Finished difference Result 601 states and 947 transitions. [2019-12-07 13:24:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:08,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 13:24:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:08,430 INFO L225 Difference]: With dead ends: 601 [2019-12-07 13:24:08,431 INFO L226 Difference]: Without dead ends: 430 [2019-12-07 13:24:08,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 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 13:24:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-07 13:24:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 230. [2019-12-07 13:24:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 13:24:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 370 transitions. [2019-12-07 13:24:08,439 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 370 transitions. Word has length 58 [2019-12-07 13:24:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:08,440 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 370 transitions. [2019-12-07 13:24:08,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 370 transitions. [2019-12-07 13:24:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:24:08,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:08,441 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, 1, 1] [2019-12-07 13:24:08,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:24:08,642 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1056532646, now seen corresponding path program 1 times [2019-12-07 13:24:08,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:08,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861518189] [2019-12-07 13:24:08,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:08,747 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:24:08,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:08,752 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 13:24:08,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:08,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:08,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:08,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:24:08,762 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 13:24:08,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:08,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:08,764 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 13:24:08,764 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:24:08,773 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 13:24:08,773 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:08,793 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 13:24:08,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861518189] [2019-12-07 13:24:08,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:08,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:08,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792007121] [2019-12-07 13:24:08,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:08,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:08,795 INFO L87 Difference]: Start difference. First operand 230 states and 370 transitions. Second operand 6 states. [2019-12-07 13:24:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:14,399 INFO L93 Difference]: Finished difference Result 654 states and 1047 transitions. [2019-12-07 13:24:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:14,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 13:24:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:14,403 INFO L225 Difference]: With dead ends: 654 [2019-12-07 13:24:14,403 INFO L226 Difference]: Without dead ends: 443 [2019-12-07 13:24:14,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 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 13:24:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-07 13:24:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 253. [2019-12-07 13:24:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-07 13:24:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 415 transitions. [2019-12-07 13:24:14,412 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 415 transitions. Word has length 59 [2019-12-07 13:24:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:14,412 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 415 transitions. [2019-12-07 13:24:14,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 415 transitions. [2019-12-07 13:24:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:24:14,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:14,413 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, 1, 1] [2019-12-07 13:24:14,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:24:14,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1468809309, now seen corresponding path program 1 times [2019-12-07 13:24:14,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:14,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595488376] [2019-12-07 13:24:14,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:14,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:24:14,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:14,828 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 13:24:14,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:14,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:14,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:14,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:24:14,841 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 13:24:14,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:14,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:14,842 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 13:24:14,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:24:14,854 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 13:24:14,854 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:14,879 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 13:24:14,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595488376] [2019-12-07 13:24:14,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:14,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:14,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910077966] [2019-12-07 13:24:14,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:14,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:14,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:14,880 INFO L87 Difference]: Start difference. First operand 253 states and 415 transitions. Second operand 6 states. [2019-12-07 13:24:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:22,637 INFO L93 Difference]: Finished difference Result 750 states and 1224 transitions. [2019-12-07 13:24:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:22,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-12-07 13:24:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:22,640 INFO L225 Difference]: With dead ends: 750 [2019-12-07 13:24:22,640 INFO L226 Difference]: Without dead ends: 516 [2019-12-07 13:24:22,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 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 13:24:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-07 13:24:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 317. [2019-12-07 13:24:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-07 13:24:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 527 transitions. [2019-12-07 13:24:22,648 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 527 transitions. Word has length 87 [2019-12-07 13:24:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:22,648 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 527 transitions. [2019-12-07 13:24:22,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 527 transitions. [2019-12-07 13:24:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 13:24:22,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:22,649 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, 1, 1, 1] [2019-12-07 13:24:22,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 13:24:22,850 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -639498598, now seen corresponding path program 1 times [2019-12-07 13:24:22,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:22,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079815425] [2019-12-07 13:24:22,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:22,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:24:22,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:22,956 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 13:24:22,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:22,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:22,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:22,960 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:24:22,970 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 13:24:22,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:22,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:22,973 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 13:24:22,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:24:22,991 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 13:24:22,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:23,019 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 13:24:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079815425] [2019-12-07 13:24:23,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:23,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:23,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093465449] [2019-12-07 13:24:23,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:23,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:23,020 INFO L87 Difference]: Start difference. First operand 317 states and 527 transitions. Second operand 6 states. [2019-12-07 13:24:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:31,201 INFO L93 Difference]: Finished difference Result 842 states and 1379 transitions. [2019-12-07 13:24:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:31,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-07 13:24:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:31,204 INFO L225 Difference]: With dead ends: 842 [2019-12-07 13:24:31,204 INFO L226 Difference]: Without dead ends: 544 [2019-12-07 13:24:31,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 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 13:24:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-07 13:24:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 354. [2019-12-07 13:24:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-07 13:24:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 591 transitions. [2019-12-07 13:24:31,217 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 591 transitions. Word has length 93 [2019-12-07 13:24:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:31,217 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 591 transitions. [2019-12-07 13:24:31,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 591 transitions. [2019-12-07 13:24:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 13:24:31,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:31,219 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, 1, 1, 1] [2019-12-07 13:24:31,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 13:24:31,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 879322610, now seen corresponding path program 1 times [2019-12-07 13:24:31,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:31,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691482854] [2019-12-07 13:24:31,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:31,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:24:31,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:31,590 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 13:24:31,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:31,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:31,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:31,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:24:31,601 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 13:24:31,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:31,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:31,603 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 13:24:31,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:24:31,616 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 13:24:31,616 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:31,644 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 13:24:31,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691482854] [2019-12-07 13:24:31,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:31,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:31,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174861783] [2019-12-07 13:24:31,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:31,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:31,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:31,645 INFO L87 Difference]: Start difference. First operand 354 states and 591 transitions. Second operand 6 states. [2019-12-07 13:24:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:38,812 INFO L93 Difference]: Finished difference Result 873 states and 1432 transitions. [2019-12-07 13:24:38,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:38,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-07 13:24:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:38,815 INFO L225 Difference]: With dead ends: 873 [2019-12-07 13:24:38,815 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 13:24:38,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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 13:24:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 13:24:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 354. [2019-12-07 13:24:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-07 13:24:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 589 transitions. [2019-12-07 13:24:38,822 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 589 transitions. Word has length 94 [2019-12-07 13:24:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:38,822 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 589 transitions. [2019-12-07 13:24:38,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 589 transitions. [2019-12-07 13:24:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:24:38,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:38,823 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, 1, 1] [2019-12-07 13:24:39,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 13:24:39,024 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash -484975122, now seen corresponding path program 1 times [2019-12-07 13:24:39,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:39,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851815502] [2019-12-07 13:24:39,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:39,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:24:39,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:39,260 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:24:39,260 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 13:24:39,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:39,268 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:39,268 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 13:24:39,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:24:39,287 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:24:39,287 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 13:24:39,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:39,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:39,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:39,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:24:39,293 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 13:24:39,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:39,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:39,295 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 13:24:39,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:24:39,311 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 13:24:39,311 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:39,343 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 13:24:39,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851815502] [2019-12-07 13:24:39,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:39,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:39,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061876192] [2019-12-07 13:24:39,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:39,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:39,345 INFO L87 Difference]: Start difference. First operand 354 states and 589 transitions. Second operand 6 states. [2019-12-07 13:24:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:45,622 INFO L93 Difference]: Finished difference Result 789 states and 1294 transitions. [2019-12-07 13:24:45,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:45,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 13:24:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:45,625 INFO L225 Difference]: With dead ends: 789 [2019-12-07 13:24:45,625 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 13:24:45,626 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 13:24:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 13:24:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2019-12-07 13:24:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-07 13:24:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 582 transitions. [2019-12-07 13:24:45,632 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 582 transitions. Word has length 100 [2019-12-07 13:24:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:45,632 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 582 transitions. [2019-12-07 13:24:45,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 582 transitions. [2019-12-07 13:24:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:24:45,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:45,633 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, 1, 1] [2019-12-07 13:24:45,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 13:24:45,834 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1232825562, now seen corresponding path program 1 times [2019-12-07 13:24:45,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:45,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412982288] [2019-12-07 13:24:45,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:46,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:24:46,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:46,096 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:24:46,096 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 13:24:46,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:46,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:46,104 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 13:24:46,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:24:46,124 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:24:46,124 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 13:24:46,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:46,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:46,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:46,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:24:46,130 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 13:24:46,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:46,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:46,131 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 13:24:46,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:24:46,141 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 13:24:46,141 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:46,178 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 13:24:46,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412982288] [2019-12-07 13:24:46,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:46,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:46,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362996739] [2019-12-07 13:24:46,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:46,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:46,179 INFO L87 Difference]: Start difference. First operand 354 states and 582 transitions. Second operand 6 states. [2019-12-07 13:24:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:50,350 INFO L93 Difference]: Finished difference Result 789 states and 1281 transitions. [2019-12-07 13:24:50,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:50,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 13:24:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:50,353 INFO L225 Difference]: With dead ends: 789 [2019-12-07 13:24:50,353 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 13:24:50,353 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 13:24:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 13:24:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2019-12-07 13:24:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-07 13:24:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 575 transitions. [2019-12-07 13:24:50,360 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 575 transitions. Word has length 100 [2019-12-07 13:24:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:50,360 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 575 transitions. [2019-12-07 13:24:50,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 575 transitions. [2019-12-07 13:24:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 13:24:50,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:50,361 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, 1, 1] [2019-12-07 13:24:50,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 13:24:50,561 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1165489495, now seen corresponding path program 1 times [2019-12-07 13:24:50,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:50,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829885097] [2019-12-07 13:24:50,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:50,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:24:50,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:50,785 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:24:50,785 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 13:24:50,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:50,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:50,795 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 13:24:50,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:24:50,815 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:24:50,816 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 13:24:50,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:50,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:50,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:50,819 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:24:50,821 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 13:24:50,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:50,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:50,823 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 13:24:50,823 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:24:50,833 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 13:24:50,833 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:50,861 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 13:24:50,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829885097] [2019-12-07 13:24:50,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:50,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:50,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763811643] [2019-12-07 13:24:50,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:50,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:50,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:50,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:50,863 INFO L87 Difference]: Start difference. First operand 354 states and 575 transitions. Second operand 6 states. [2019-12-07 13:24:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:54,784 INFO L93 Difference]: Finished difference Result 789 states and 1268 transitions. [2019-12-07 13:24:54,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:54,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 13:24:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:54,787 INFO L225 Difference]: With dead ends: 789 [2019-12-07 13:24:54,787 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 13:24:54,787 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 13:24:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 13:24:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2019-12-07 13:24:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-07 13:24:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 568 transitions. [2019-12-07 13:24:54,793 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 568 transitions. Word has length 101 [2019-12-07 13:24:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:54,794 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 568 transitions. [2019-12-07 13:24:54,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 568 transitions. [2019-12-07 13:24:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 13:24:54,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:54,794 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, 1] [2019-12-07 13:24:54,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 13:24:54,995 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash 204655220, now seen corresponding path program 1 times [2019-12-07 13:24:54,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:24:54,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781765741] [2019-12-07 13:24:54,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:24:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:55,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:24:55,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:24:55,136 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 13:24:55,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:55,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:55,139 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:24:55,139 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:24:55,147 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 13:24:55,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:24:55,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:24:55,148 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 13:24:55,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:24:55,166 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 13:24:55,166 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:24:55,191 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 13:24:55,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781765741] [2019-12-07 13:24:55,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:55,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:24:55,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193314169] [2019-12-07 13:24:55,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:55,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:24:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:55,192 INFO L87 Difference]: Start difference. First operand 354 states and 568 transitions. Second operand 6 states. [2019-12-07 13:25:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:02,247 INFO L93 Difference]: Finished difference Result 911 states and 1448 transitions. [2019-12-07 13:25:02,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:02,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 13:25:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:02,252 INFO L225 Difference]: With dead ends: 911 [2019-12-07 13:25:02,252 INFO L226 Difference]: Without dead ends: 576 [2019-12-07 13:25:02,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 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 13:25:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-07 13:25:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 397. [2019-12-07 13:25:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-07 13:25:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 638 transitions. [2019-12-07 13:25:02,263 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 638 transitions. Word has length 101 [2019-12-07 13:25:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:02,263 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 638 transitions. [2019-12-07 13:25:02,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 638 transitions. [2019-12-07 13:25:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 13:25:02,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:02,264 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, 1, 1] [2019-12-07 13:25:02,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 13:25:02,466 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -524237803, now seen corresponding path program 1 times [2019-12-07 13:25:02,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:02,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819878907] [2019-12-07 13:25:02,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:02,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:25:02,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:02,778 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:25:02,779 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 13:25:02,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:02,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:02,789 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 13:25:02,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:25:02,807 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:25:02,807 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 13:25:02,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:02,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:02,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:02,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:25:02,812 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 13:25:02,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:02,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:02,814 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 13:25:02,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:25:02,824 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 13:25:02,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:02,853 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 13:25:02,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819878907] [2019-12-07 13:25:02,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:02,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:02,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460561773] [2019-12-07 13:25:02,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:02,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:02,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:02,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:02,855 INFO L87 Difference]: Start difference. First operand 397 states and 638 transitions. Second operand 6 states. [2019-12-07 13:25:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:07,000 INFO L93 Difference]: Finished difference Result 875 states and 1395 transitions. [2019-12-07 13:25:07,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:07,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-07 13:25:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:07,003 INFO L225 Difference]: With dead ends: 875 [2019-12-07 13:25:07,003 INFO L226 Difference]: Without dead ends: 497 [2019-12-07 13:25:07,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 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 13:25:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-12-07 13:25:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 397. [2019-12-07 13:25:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-07 13:25:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-12-07 13:25:07,010 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 102 [2019-12-07 13:25:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:07,010 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-12-07 13:25:07,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-12-07 13:25:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 13:25:07,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:07,011 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, 1, 1] [2019-12-07 13:25:07,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 13:25:07,212 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1607914476, now seen corresponding path program 1 times [2019-12-07 13:25:07,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:07,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696064104] [2019-12-07 13:25:07,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:07,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:07,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:07,425 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 13:25:07,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:07,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:07,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:07,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:07,436 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 13:25:07,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:07,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:07,438 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 13:25:07,438 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:07,452 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 13:25:07,452 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:07,479 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 13:25:07,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696064104] [2019-12-07 13:25:07,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:07,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:07,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367175543] [2019-12-07 13:25:07,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:07,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:07,480 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 6 states. [2019-12-07 13:25:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:16,358 INFO L93 Difference]: Finished difference Result 951 states and 1496 transitions. [2019-12-07 13:25:16,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:16,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-07 13:25:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:16,362 INFO L225 Difference]: With dead ends: 951 [2019-12-07 13:25:16,362 INFO L226 Difference]: Without dead ends: 569 [2019-12-07 13:25:16,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 198 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 13:25:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-12-07 13:25:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 399. [2019-12-07 13:25:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 13:25:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 633 transitions. [2019-12-07 13:25:16,369 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 633 transitions. Word has length 102 [2019-12-07 13:25:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:16,369 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 633 transitions. [2019-12-07 13:25:16,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 633 transitions. [2019-12-07 13:25:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 13:25:16,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:16,370 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, 1, 1] [2019-12-07 13:25:16,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 13:25:16,571 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash -968485710, now seen corresponding path program 1 times [2019-12-07 13:25:16,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:16,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48732288] [2019-12-07 13:25:16,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:16,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:25:16,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:16,798 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:25:16,799 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 13:25:16,799 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:16,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:16,807 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 13:25:16,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 13:25:16,826 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 13:25:16,827 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 13:25:16,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:16,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:16,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:16,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 13:25:16,832 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 13:25:16,833 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:16,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:16,834 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 13:25:16,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:25:16,845 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 13:25:16,845 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:16,873 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 13:25:16,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48732288] [2019-12-07 13:25:16,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:16,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:16,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720205646] [2019-12-07 13:25:16,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:16,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:16,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:16,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:16,874 INFO L87 Difference]: Start difference. First operand 399 states and 633 transitions. Second operand 6 states. [2019-12-07 13:25:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:22,082 INFO L93 Difference]: Finished difference Result 855 states and 1353 transitions. [2019-12-07 13:25:22,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:22,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-12-07 13:25:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:22,085 INFO L225 Difference]: With dead ends: 855 [2019-12-07 13:25:22,085 INFO L226 Difference]: Without dead ends: 475 [2019-12-07 13:25:22,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 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 13:25:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-07 13:25:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 399. [2019-12-07 13:25:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 13:25:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 625 transitions. [2019-12-07 13:25:22,092 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 625 transitions. Word has length 103 [2019-12-07 13:25:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:22,092 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 625 transitions. [2019-12-07 13:25:22,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 625 transitions. [2019-12-07 13:25:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 13:25:22,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:22,093 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, 1, 1] [2019-12-07 13:25:22,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 13:25:22,294 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash 884501920, now seen corresponding path program 1 times [2019-12-07 13:25:22,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:22,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515011687] [2019-12-07 13:25:22,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:22,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:22,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:22,452 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 13:25:22,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:22,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:22,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:22,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:22,463 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 13:25:22,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:22,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:22,465 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 13:25:22,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:22,480 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 13:25:22,480 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:22,506 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 13:25:22,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515011687] [2019-12-07 13:25:22,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:22,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:22,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552345495] [2019-12-07 13:25:22,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:22,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:22,507 INFO L87 Difference]: Start difference. First operand 399 states and 625 transitions. Second operand 6 states. [2019-12-07 13:25:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:29,236 INFO L93 Difference]: Finished difference Result 971 states and 1516 transitions. [2019-12-07 13:25:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:29,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-07 13:25:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:29,240 INFO L225 Difference]: With dead ends: 971 [2019-12-07 13:25:29,240 INFO L226 Difference]: Without dead ends: 591 [2019-12-07 13:25:29,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 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 13:25:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-12-07 13:25:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 429. [2019-12-07 13:25:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 13:25:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 667 transitions. [2019-12-07 13:25:29,249 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 667 transitions. Word has length 114 [2019-12-07 13:25:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:29,249 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 667 transitions. [2019-12-07 13:25:29,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 667 transitions. [2019-12-07 13:25:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 13:25:29,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:29,251 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, 1, 1] [2019-12-07 13:25:29,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 13:25:29,452 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:29,452 INFO L82 PathProgramCache]: Analyzing trace with hash 794692387, now seen corresponding path program 1 times [2019-12-07 13:25:29,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:29,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766975294] [2019-12-07 13:25:29,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:29,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:29,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:29,619 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 13:25:29,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:29,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:29,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:29,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:29,628 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 13:25:29,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:29,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:29,630 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 13:25:29,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:29,644 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 13:25:29,644 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:29,671 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 13:25:29,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766975294] [2019-12-07 13:25:29,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:29,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:29,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055543646] [2019-12-07 13:25:29,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:29,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:29,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:29,672 INFO L87 Difference]: Start difference. First operand 429 states and 667 transitions. Second operand 6 states. [2019-12-07 13:25:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:35,135 INFO L93 Difference]: Finished difference Result 987 states and 1531 transitions. [2019-12-07 13:25:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:35,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 13:25:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:35,138 INFO L225 Difference]: With dead ends: 987 [2019-12-07 13:25:35,138 INFO L226 Difference]: Without dead ends: 577 [2019-12-07 13:25:35,139 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 13:25:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-07 13:25:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 429. [2019-12-07 13:25:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 13:25:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 661 transitions. [2019-12-07 13:25:35,146 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 661 transitions. Word has length 115 [2019-12-07 13:25:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:35,146 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 661 transitions. [2019-12-07 13:25:35,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 661 transitions. [2019-12-07 13:25:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 13:25:35,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:35,147 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, 1, 1, 1] [2019-12-07 13:25:35,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 13:25:35,348 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2025819035, now seen corresponding path program 1 times [2019-12-07 13:25:35,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:35,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239040072] [2019-12-07 13:25:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:35,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:35,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:35,596 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 13:25:35,597 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:35,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:35,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:35,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:35,606 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 13:25:35,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:35,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:35,607 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 13:25:35,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:35,621 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 13:25:35,621 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:35,646 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 13:25:35,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239040072] [2019-12-07 13:25:35,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:35,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:35,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249319845] [2019-12-07 13:25:35,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:35,647 INFO L87 Difference]: Start difference. First operand 429 states and 661 transitions. Second operand 6 states. [2019-12-07 13:25:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:42,140 INFO L93 Difference]: Finished difference Result 1029 states and 1582 transitions. [2019-12-07 13:25:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:42,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-12-07 13:25:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:42,143 INFO L225 Difference]: With dead ends: 1029 [2019-12-07 13:25:42,143 INFO L226 Difference]: Without dead ends: 619 [2019-12-07 13:25:42,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 230 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 13:25:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-12-07 13:25:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2019-12-07 13:25:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 13:25:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 698 transitions. [2019-12-07 13:25:42,152 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 698 transitions. Word has length 118 [2019-12-07 13:25:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:42,152 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 698 transitions. [2019-12-07 13:25:42,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 698 transitions. [2019-12-07 13:25:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 13:25:42,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:42,154 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, 1, 1, 1] [2019-12-07 13:25:42,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 13:25:42,355 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash -167226306, now seen corresponding path program 1 times [2019-12-07 13:25:42,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:42,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182384716] [2019-12-07 13:25:42,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:42,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:42,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:42,598 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 13:25:42,598 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:42,600 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:42,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:42,600 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:42,607 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 13:25:42,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:42,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:42,609 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 13:25:42,609 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:42,632 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 13:25:42,632 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:42,659 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 13:25:42,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182384716] [2019-12-07 13:25:42,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:42,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:42,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090799808] [2019-12-07 13:25:42,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:42,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:42,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:42,660 INFO L87 Difference]: Start difference. First operand 457 states and 698 transitions. Second operand 6 states. [2019-12-07 13:25:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:51,880 INFO L93 Difference]: Finished difference Result 1035 states and 1578 transitions. [2019-12-07 13:25:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:51,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-12-07 13:25:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:51,882 INFO L225 Difference]: With dead ends: 1035 [2019-12-07 13:25:51,882 INFO L226 Difference]: Without dead ends: 597 [2019-12-07 13:25:51,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 232 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 13:25:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-12-07 13:25:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 457. [2019-12-07 13:25:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 13:25:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 691 transitions. [2019-12-07 13:25:51,893 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 691 transitions. Word has length 119 [2019-12-07 13:25:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:51,893 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 691 transitions. [2019-12-07 13:25:51,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 691 transitions. [2019-12-07 13:25:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 13:25:51,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:51,895 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, 1, 1, 1, 1] [2019-12-07 13:25:52,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 13:25:52,096 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash 326363942, now seen corresponding path program 1 times [2019-12-07 13:25:52,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:52,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505008890] [2019-12-07 13:25:52,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:52,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:52,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:52,270 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 13:25:52,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:52,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:52,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:52,273 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:52,281 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 13:25:52,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:52,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:52,283 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 13:25:52,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:52,299 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 13:25:52,299 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:52,327 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 13:25:52,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505008890] [2019-12-07 13:25:52,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:52,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507553456] [2019-12-07 13:25:52,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:52,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:52,328 INFO L87 Difference]: Start difference. First operand 457 states and 691 transitions. Second operand 6 states. [2019-12-07 13:25:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:59,039 INFO L93 Difference]: Finished difference Result 1077 states and 1625 transitions. [2019-12-07 13:25:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:59,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-12-07 13:25:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:59,042 INFO L225 Difference]: With dead ends: 1077 [2019-12-07 13:25:59,042 INFO L226 Difference]: Without dead ends: 639 [2019-12-07 13:25:59,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 246 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 13:25:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-12-07 13:25:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 492. [2019-12-07 13:25:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-12-07 13:25:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 740 transitions. [2019-12-07 13:25:59,052 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 740 transitions. Word has length 126 [2019-12-07 13:25:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,053 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 740 transitions. [2019-12-07 13:25:59,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 740 transitions. [2019-12-07 13:25:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 13:25:59,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,054 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, 1, 1, 1, 1] [2019-12-07 13:25:59,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 13:25:59,255 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1318009298, now seen corresponding path program 1 times [2019-12-07 13:25:59,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:25:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879049000] [2019-12-07 13:25:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:25:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:25:59,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:59,408 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 13:25:59,408 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:59,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:59,412 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:25:59,412 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:25:59,418 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 13:25:59,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:25:59,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:25:59,420 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 13:25:59,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:25:59,437 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 13:25:59,437 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:25:59,464 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 13:25:59,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879049000] [2019-12-07 13:25:59,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:25:59,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735453937] [2019-12-07 13:25:59,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:59,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:25:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:59,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:59,465 INFO L87 Difference]: Start difference. First operand 492 states and 740 transitions. Second operand 6 states. [2019-12-07 13:26:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:07,253 INFO L93 Difference]: Finished difference Result 1102 states and 1656 transitions. [2019-12-07 13:26:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:07,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-12-07 13:26:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:07,256 INFO L225 Difference]: With dead ends: 1102 [2019-12-07 13:26:07,256 INFO L226 Difference]: Without dead ends: 629 [2019-12-07 13:26:07,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 248 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 13:26:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-07 13:26:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 492. [2019-12-07 13:26:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-12-07 13:26:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 736 transitions. [2019-12-07 13:26:07,265 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 736 transitions. Word has length 127 [2019-12-07 13:26:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:07,265 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 736 transitions. [2019-12-07 13:26:07,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 736 transitions. [2019-12-07 13:26:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 13:26:07,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:07,266 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, 1, 1] [2019-12-07 13:26:07,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 13:26:07,467 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:07,468 INFO L82 PathProgramCache]: Analyzing trace with hash -743913870, now seen corresponding path program 1 times [2019-12-07 13:26:07,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:07,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468592132] [2019-12-07 13:26:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:07,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:07,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:07,768 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 13:26:07,769 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:07,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:07,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:07,771 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:07,778 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 13:26:07,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:07,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:07,780 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 13:26:07,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:07,800 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 13:26:07,800 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:07,832 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 13:26:07,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468592132] [2019-12-07 13:26:07,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:07,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:07,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331142059] [2019-12-07 13:26:07,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:07,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:07,833 INFO L87 Difference]: Start difference. First operand 492 states and 736 transitions. Second operand 6 states. [2019-12-07 13:26:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:17,243 INFO L93 Difference]: Finished difference Result 1145 states and 1708 transitions. [2019-12-07 13:26:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:17,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-12-07 13:26:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:17,246 INFO L225 Difference]: With dead ends: 1145 [2019-12-07 13:26:17,246 INFO L226 Difference]: Without dead ends: 672 [2019-12-07 13:26:17,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 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 13:26:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-07 13:26:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 535. [2019-12-07 13:26:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-12-07 13:26:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 795 transitions. [2019-12-07 13:26:17,256 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 795 transitions. Word has length 142 [2019-12-07 13:26:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:17,256 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 795 transitions. [2019-12-07 13:26:17,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 795 transitions. [2019-12-07 13:26:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 13:26:17,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:17,257 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, 1, 1] [2019-12-07 13:26:17,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 13:26:17,458 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -630654118, now seen corresponding path program 1 times [2019-12-07 13:26:17,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:17,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7305344] [2019-12-07 13:26:17,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:17,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:17,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:17,654 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 13:26:17,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:17,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:17,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:17,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:17,665 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 13:26:17,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:17,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:17,667 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 13:26:17,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:17,687 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 13:26:17,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:17,720 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 13:26:17,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7305344] [2019-12-07 13:26:17,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:17,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:17,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688582142] [2019-12-07 13:26:17,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:17,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:17,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:17,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:17,721 INFO L87 Difference]: Start difference. First operand 535 states and 795 transitions. Second operand 6 states. [2019-12-07 13:26:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:24,256 INFO L93 Difference]: Finished difference Result 1186 states and 1762 transitions. [2019-12-07 13:26:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:24,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-12-07 13:26:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:24,259 INFO L225 Difference]: With dead ends: 1186 [2019-12-07 13:26:24,259 INFO L226 Difference]: Without dead ends: 654 [2019-12-07 13:26:24,260 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 13:26:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-12-07 13:26:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 527. [2019-12-07 13:26:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-07 13:26:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2019-12-07 13:26:24,269 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 143 [2019-12-07 13:26:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:24,269 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2019-12-07 13:26:24,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2019-12-07 13:26:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 13:26:24,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:24,270 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, 1, 1, 1] [2019-12-07 13:26:24,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 13:26:24,471 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:24,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:24,471 INFO L82 PathProgramCache]: Analyzing trace with hash -356606618, now seen corresponding path program 1 times [2019-12-07 13:26:24,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:24,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824974910] [2019-12-07 13:26:24,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:24,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:24,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:24,667 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 13:26:24,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:24,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:24,670 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:24,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:24,677 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 13:26:24,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:24,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:24,678 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 13:26:24,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:24,696 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 13:26:24,696 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:24,725 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 13:26:24,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824974910] [2019-12-07 13:26:24,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:24,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:24,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935850742] [2019-12-07 13:26:24,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:24,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:24,726 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand 6 states. [2019-12-07 13:26:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:30,308 INFO L93 Difference]: Finished difference Result 1196 states and 1775 transitions. [2019-12-07 13:26:30,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:30,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-12-07 13:26:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:30,312 INFO L225 Difference]: With dead ends: 1196 [2019-12-07 13:26:30,312 INFO L226 Difference]: Without dead ends: 688 [2019-12-07 13:26:30,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 286 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 13:26:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-07 13:26:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 553. [2019-12-07 13:26:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-12-07 13:26:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2019-12-07 13:26:30,322 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 146 [2019-12-07 13:26:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:30,322 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2019-12-07 13:26:30,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2019-12-07 13:26:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 13:26:30,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:30,323 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, 1, 1, 1] [2019-12-07 13:26:30,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 13:26:30,524 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2139901911, now seen corresponding path program 1 times [2019-12-07 13:26:30,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:30,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689123483] [2019-12-07 13:26:30,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:30,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:30,695 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:30,698 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 13:26:30,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:30,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:30,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:30,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:30,709 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 13:26:30,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:30,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:30,710 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 13:26:30,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:30,729 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 13:26:30,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:30,758 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 13:26:30,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689123483] [2019-12-07 13:26:30,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:30,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:30,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296910971] [2019-12-07 13:26:30,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:30,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:30,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:30,759 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand 6 states. [2019-12-07 13:26:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:36,813 INFO L93 Difference]: Finished difference Result 1212 states and 1781 transitions. [2019-12-07 13:26:36,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:36,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-12-07 13:26:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:36,816 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 13:26:36,816 INFO L226 Difference]: Without dead ends: 678 [2019-12-07 13:26:36,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 288 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 13:26:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-07 13:26:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 553. [2019-12-07 13:26:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-12-07 13:26:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 801 transitions. [2019-12-07 13:26:36,826 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 801 transitions. Word has length 147 [2019-12-07 13:26:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:36,827 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 801 transitions. [2019-12-07 13:26:36,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 801 transitions. [2019-12-07 13:26:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 13:26:36,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:36,828 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:26:37,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 13:26:37,029 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1509603254, now seen corresponding path program 1 times [2019-12-07 13:26:37,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:37,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943829316] [2019-12-07 13:26:37,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:37,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:37,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:37,234 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 13:26:37,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:37,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:37,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:37,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:37,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 19 treesize of output 7 [2019-12-07 13:26:37,244 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:37,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:37,246 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 13:26:37,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:37,267 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 13:26:37,267 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:37,304 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 13:26:37,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943829316] [2019-12-07 13:26:37,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:37,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:37,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460557246] [2019-12-07 13:26:37,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:37,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:37,305 INFO L87 Difference]: Start difference. First operand 553 states and 801 transitions. Second operand 6 states. [2019-12-07 13:26:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:45,844 INFO L93 Difference]: Finished difference Result 1246 states and 1809 transitions. [2019-12-07 13:26:45,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:45,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-12-07 13:26:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:45,847 INFO L225 Difference]: With dead ends: 1246 [2019-12-07 13:26:45,847 INFO L226 Difference]: Without dead ends: 712 [2019-12-07 13:26:45,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 314 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 13:26:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-12-07 13:26:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 586. [2019-12-07 13:26:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-12-07 13:26:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 843 transitions. [2019-12-07 13:26:45,858 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 843 transitions. Word has length 160 [2019-12-07 13:26:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:45,858 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 843 transitions. [2019-12-07 13:26:45,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 843 transitions. [2019-12-07 13:26:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 13:26:45,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:45,859 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:26:46,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 13:26:46,060 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash -266629090, now seen corresponding path program 1 times [2019-12-07 13:26:46,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:46,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020049159] [2019-12-07 13:26:46,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:46,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:46,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:46,250 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 13:26:46,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:46,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:46,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:46,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:46,260 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 13:26:46,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:46,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:46,262 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 13:26:46,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:46,284 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 13:26:46,284 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:46,317 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 13:26:46,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020049159] [2019-12-07 13:26:46,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:46,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:46,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292650614] [2019-12-07 13:26:46,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:46,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:46,318 INFO L87 Difference]: Start difference. First operand 586 states and 843 transitions. Second operand 6 states. [2019-12-07 13:26:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:54,884 INFO L93 Difference]: Finished difference Result 1272 states and 1834 transitions. [2019-12-07 13:26:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:54,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-12-07 13:26:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:54,888 INFO L225 Difference]: With dead ends: 1272 [2019-12-07 13:26:54,888 INFO L226 Difference]: Without dead ends: 687 [2019-12-07 13:26:54,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 316 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 13:26:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-07 13:26:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 577. [2019-12-07 13:26:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-07 13:26:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 823 transitions. [2019-12-07 13:26:54,899 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 823 transitions. Word has length 161 [2019-12-07 13:26:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:54,899 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 823 transitions. [2019-12-07 13:26:54,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 823 transitions. [2019-12-07 13:26:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 13:26:54,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:54,900 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, 1, 1] [2019-12-07 13:26:55,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 13:26:55,102 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 888451936, now seen corresponding path program 1 times [2019-12-07 13:26:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:26:55,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207978430] [2019-12-07 13:26:55,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:26:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:55,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:26:55,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:26:55,280 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 13:26:55,280 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:55,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:55,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:26:55,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:26:55,289 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 13:26:55,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:26:55,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:26:55,290 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 13:26:55,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:26:55,309 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 13:26:55,309 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:26:55,338 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 13:26:55,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207978430] [2019-12-07 13:26:55,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:55,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:26:55,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974504464] [2019-12-07 13:26:55,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:55,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:26:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:55,340 INFO L87 Difference]: Start difference. First operand 577 states and 823 transitions. Second operand 6 states. [2019-12-07 13:27:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:01,072 INFO L93 Difference]: Finished difference Result 1270 states and 1821 transitions. [2019-12-07 13:27:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:01,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-12-07 13:27:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:01,077 INFO L225 Difference]: With dead ends: 1270 [2019-12-07 13:27:01,077 INFO L226 Difference]: Without dead ends: 712 [2019-12-07 13:27:01,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 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 13:27:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-12-07 13:27:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 599. [2019-12-07 13:27:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-07 13:27:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 843 transitions. [2019-12-07 13:27:01,090 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 843 transitions. Word has length 164 [2019-12-07 13:27:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:01,090 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 843 transitions. [2019-12-07 13:27:01,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:27:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 843 transitions. [2019-12-07 13:27:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 13:27:01,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:01,091 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, 1, 1] [2019-12-07 13:27:01,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 13:27:01,293 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash 809471139, now seen corresponding path program 1 times [2019-12-07 13:27:01,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:01,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452025137] [2019-12-07 13:27:01,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:01,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:27:01,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:01,583 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 13:27:01,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:01,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:01,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:01,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:27:01,592 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 13:27:01,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:01,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:01,594 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 13:27:01,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:27:01,614 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 13:27:01,614 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:01,644 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 13:27:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452025137] [2019-12-07 13:27:01,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:01,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:27:01,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368001978] [2019-12-07 13:27:01,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:27:01,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:27:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:01,645 INFO L87 Difference]: Start difference. First operand 599 states and 843 transitions. Second operand 6 states. [2019-12-07 13:27:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:08,969 INFO L93 Difference]: Finished difference Result 1285 states and 1817 transitions. [2019-12-07 13:27:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:08,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-12-07 13:27:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:08,974 INFO L225 Difference]: With dead ends: 1285 [2019-12-07 13:27:08,974 INFO L226 Difference]: Without dead ends: 705 [2019-12-07 13:27:08,974 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 13:27:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-07 13:27:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 599. [2019-12-07 13:27:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-07 13:27:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 831 transitions. [2019-12-07 13:27:08,986 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 831 transitions. Word has length 165 [2019-12-07 13:27:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:08,986 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 831 transitions. [2019-12-07 13:27:08,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:27:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 831 transitions. [2019-12-07 13:27:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 13:27:08,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:08,987 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 13:27:09,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 13:27:09,189 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 485310471, now seen corresponding path program 1 times [2019-12-07 13:27:09,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:09,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576818397] [2019-12-07 13:27:09,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:09,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:27:09,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:09,424 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 13:27:09,424 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:09,448 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 13:27:09,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576818397] [2019-12-07 13:27:09,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:09,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:27:09,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727304108] [2019-12-07 13:27:09,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:09,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:09,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:09,449 INFO L87 Difference]: Start difference. First operand 599 states and 831 transitions. Second operand 4 states. [2019-12-07 13:27:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:10,114 INFO L93 Difference]: Finished difference Result 2286 states and 3187 transitions. [2019-12-07 13:27:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:10,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-12-07 13:27:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:10,119 INFO L225 Difference]: With dead ends: 2286 [2019-12-07 13:27:10,120 INFO L226 Difference]: Without dead ends: 1706 [2019-12-07 13:27:10,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-07 13:27:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1683. [2019-12-07 13:27:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-12-07 13:27:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2332 transitions. [2019-12-07 13:27:10,152 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2332 transitions. Word has length 167 [2019-12-07 13:27:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:10,152 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2332 transitions. [2019-12-07 13:27:10,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2332 transitions. [2019-12-07 13:27:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 13:27:10,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:10,154 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, 1, 1, 1] [2019-12-07 13:27:10,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 13:27:10,355 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash -514909594, now seen corresponding path program 1 times [2019-12-07 13:27:10,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:10,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848305711] [2019-12-07 13:27:10,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:10,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:27:10,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:10,704 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 13:27:10,704 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:10,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:10,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:10,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:27:10,713 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 13:27:10,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:10,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:10,714 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 13:27:10,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:27:10,734 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 13:27:10,735 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:10,774 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 13:27:10,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848305711] [2019-12-07 13:27:10,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:10,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:27:10,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854838398] [2019-12-07 13:27:10,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:27:10,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:10,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:27:10,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:10,775 INFO L87 Difference]: Start difference. First operand 1683 states and 2332 transitions. Second operand 6 states. [2019-12-07 13:27:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:20,746 INFO L93 Difference]: Finished difference Result 3721 states and 5160 transitions. [2019-12-07 13:27:20,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:20,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-12-07 13:27:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:20,755 INFO L225 Difference]: With dead ends: 3721 [2019-12-07 13:27:20,755 INFO L226 Difference]: Without dead ends: 2057 [2019-12-07 13:27:20,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 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 13:27:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-12-07 13:27:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1755. [2019-12-07 13:27:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-07 13:27:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2399 transitions. [2019-12-07 13:27:20,799 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2399 transitions. Word has length 168 [2019-12-07 13:27:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:20,799 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 2399 transitions. [2019-12-07 13:27:20,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:27:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2399 transitions. [2019-12-07 13:27:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 13:27:20,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:20,801 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] [2019-12-07 13:27:21,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 13:27:21,002 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1215349056, now seen corresponding path program 1 times [2019-12-07 13:27:21,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:21,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044212473] [2019-12-07 13:27:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:21,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:27:21,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:21,198 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 13:27:21,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:21,214 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 13:27:21,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044212473] [2019-12-07 13:27:21,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:21,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:27:21,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384764958] [2019-12-07 13:27:21,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:21,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:21,215 INFO L87 Difference]: Start difference. First operand 1755 states and 2399 transitions. Second operand 3 states. [2019-12-07 13:27:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:21,944 INFO L93 Difference]: Finished difference Result 4022 states and 5509 transitions. [2019-12-07 13:27:21,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:21,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 13:27:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:21,952 INFO L225 Difference]: With dead ends: 4022 [2019-12-07 13:27:21,952 INFO L226 Difference]: Without dead ends: 2286 [2019-12-07 13:27:21,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 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 13:27:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2019-12-07 13:27:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2265. [2019-12-07 13:27:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2019-12-07 13:27:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3093 transitions. [2019-12-07 13:27:21,999 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3093 transitions. Word has length 168 [2019-12-07 13:27:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:21,999 INFO L462 AbstractCegarLoop]: Abstraction has 2265 states and 3093 transitions. [2019-12-07 13:27:21,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3093 transitions. [2019-12-07 13:27:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 13:27:22,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:22,001 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] [2019-12-07 13:27:22,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 13:27:22,202 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1601211458, now seen corresponding path program 1 times [2019-12-07 13:27:22,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:22,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898572886] [2019-12-07 13:27:22,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:22,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:27:22,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:22,375 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 13:27:22,375 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:22,389 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 13:27:22,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898572886] [2019-12-07 13:27:22,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:22,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:27:22,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249870861] [2019-12-07 13:27:22,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:22,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:22,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:22,390 INFO L87 Difference]: Start difference. First operand 2265 states and 3093 transitions. Second operand 3 states. [2019-12-07 13:27:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:22,490 INFO L93 Difference]: Finished difference Result 5088 states and 6954 transitions. [2019-12-07 13:27:22,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:22,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 13:27:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:22,500 INFO L225 Difference]: With dead ends: 5088 [2019-12-07 13:27:22,500 INFO L226 Difference]: Without dead ends: 2842 [2019-12-07 13:27:22,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 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 13:27:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2019-12-07 13:27:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2821. [2019-12-07 13:27:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-07 13:27:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3844 transitions. [2019-12-07 13:27:22,559 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3844 transitions. Word has length 168 [2019-12-07 13:27:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:22,559 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 3844 transitions. [2019-12-07 13:27:22,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3844 transitions. [2019-12-07 13:27:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 13:27:22,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:22,561 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, 1, 1, 1] [2019-12-07 13:27:22,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 13:27:22,762 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:22,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1153416203, now seen corresponding path program 1 times [2019-12-07 13:27:22,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:22,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489124733] [2019-12-07 13:27:22,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:23,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:27:23,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:23,007 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 13:27:23,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:23,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:23,009 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:23,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:27:23,016 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 13:27:23,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:23,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:23,017 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 13:27:23,017 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:27:23,038 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 13:27:23,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:23,069 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 13:27:23,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489124733] [2019-12-07 13:27:23,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:23,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:27:23,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470080120] [2019-12-07 13:27:23,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:27:23,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:27:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:23,070 INFO L87 Difference]: Start difference. First operand 2821 states and 3844 transitions. Second operand 6 states. [2019-12-07 13:27:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:29,372 INFO L93 Difference]: Finished difference Result 4934 states and 6732 transitions. [2019-12-07 13:27:29,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:29,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2019-12-07 13:27:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:29,376 INFO L225 Difference]: With dead ends: 4934 [2019-12-07 13:27:29,376 INFO L226 Difference]: Without dead ends: 2097 [2019-12-07 13:27:29,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 332 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 13:27:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2019-12-07 13:27:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 1812. [2019-12-07 13:27:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1812 states. [2019-12-07 13:27:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2440 transitions. [2019-12-07 13:27:29,417 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2440 transitions. Word has length 169 [2019-12-07 13:27:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:29,418 INFO L462 AbstractCegarLoop]: Abstraction has 1812 states and 2440 transitions. [2019-12-07 13:27:29,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:27:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2440 transitions. [2019-12-07 13:27:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 13:27:29,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:29,419 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, 1, 1, 1, 1] [2019-12-07 13:27:29,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 13:27:29,620 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash 165451016, now seen corresponding path program 1 times [2019-12-07 13:27:29,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:29,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073665559] [2019-12-07 13:27:29,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:27:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:29,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 13:27:29,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:32,128 INFO L237 Elim1Store]: Index analysis took 505 ms [2019-12-07 13:27:32,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:32,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 13:27:32,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:34,949 WARN L192 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 13:27:34,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:34,952 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_343|, |v_#memory_$Pointer$.offset_344|], 2=[|v_#memory_$Pointer$.offset_340|, |v_#memory_$Pointer$.offset_341|, |v_#memory_$Pointer$.base_341|, |v_#memory_$Pointer$.base_340|]} [2019-12-07 13:27:35,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:35,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:35,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:35,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:35,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:35,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:35,819 INFO L237 Elim1Store]: Index analysis took 787 ms [2019-12-07 13:27:37,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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 13:27:37,027 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:38,752 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 13:27:38,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:38,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:38,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:38,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:38,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:38,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:38,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:39,022 INFO L237 Elim1Store]: Index analysis took 199 ms [2019-12-07 13:27:39,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 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 13:27:39,190 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:40,086 WARN L192 SmtUtils]: Spent 895.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 13:27:40,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:40,097 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 13:27:40,828 WARN L192 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:27:40,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:40,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:40,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-12-07 13:27:40,938 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,251 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 13:27:41,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 13:27:41,292 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,438 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 13:27:41,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 13:27:41,459 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,507 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 13:27:41,535 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_345|], 12=[|v_#memory_$Pointer$.base_344|]} [2019-12-07 13:27:41,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,548 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 29 treesize of output 13 [2019-12-07 13:27:41,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,629 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 98 treesize of output 52 [2019-12-07 13:27:41,629 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,653 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:27:41,658 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_346|], 12=[|v_#memory_$Pointer$.base_345|]} [2019-12-07 13:27:41,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,671 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 29 treesize of output 13 [2019-12-07 13:27:41,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,742 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 98 treesize of output 52 [2019-12-07 13:27:41,743 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:41,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:41,766 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:27:41,769 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_342|], 12=[|v_#memory_$Pointer$.base_346|]} [2019-12-07 13:27:41,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:41,839 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 29 treesize of output 13 [2019-12-07 13:27:41,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,092 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 13:27:42,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,119 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 29 treesize of output 13 [2019-12-07 13:27:42,120 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,247 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 13:27:42,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,251 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 13:27:42,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,345 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 0 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 13:27:42,346 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,373 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 13:27:42,378 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_348|], 12=[|v_#memory_$Pointer$.base_347|]} [2019-12-07 13:27:42,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,390 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 29 treesize of output 13 [2019-12-07 13:27:42,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,467 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 98 treesize of output 52 [2019-12-07 13:27:42,467 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,497 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:27:42,499 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_349|], 12=[|v_#memory_$Pointer$.base_348|]} [2019-12-07 13:27:42,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,512 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 29 treesize of output 13 [2019-12-07 13:27:42,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,584 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 98 treesize of output 52 [2019-12-07 13:27:42,585 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,611 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:27:42,617 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_349|], 12=[|v_#memory_$Pointer$.offset_350|]} [2019-12-07 13:27:42,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,622 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 128 treesize of output 56 [2019-12-07 13:27:42,622 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:42,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-12-07 13:27:42,656 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:42,678 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:44 [2019-12-07 13:27:42,717 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_343|], 20=[|v_#memory_$Pointer$.offset_351|]} [2019-12-07 13:27:42,721 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 13:27:42,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2019-12-07 13:27:42,809 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:42,838 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2019-12-07 13:27:42,882 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_399|], 20=[|v_#memory_$Pointer$.offset_352|]} [2019-12-07 13:27:42,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 13:27:42,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:42,942 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 0 case distinctions, treesize of input 48 treesize of output 44 [2019-12-07 13:27:42,943 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:42,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:42,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:42,967 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2019-12-07 13:27:43,010 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_350|], 2=[|v_#memory_int_400|], 12=[|v_#memory_$Pointer$.offset_353|]} [2019-12-07 13:27:43,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 13:27:43,016 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 13:27:43,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:43,069 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 29 treesize of output 28 [2019-12-07 13:27:43,069 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:43,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:43,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2019-12-07 13:27:43,111 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:43,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:43,125 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:20 [2019-12-07 13:27:43,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:43,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:43,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:27:43,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 13:27:43,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:43,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,160 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:43,160 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-12-07 13:27:43,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,196 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 3 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 13:27:43,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:43,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,197 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 13:27:43,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-12-07 13:27:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:27:43,431 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:43,472 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 37 treesize of output 25 [2019-12-07 13:27:43,472 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 13:27:43,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:43,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 13:27:43,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:43,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,573 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 13:27:43,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:43,588 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:17 [2019-12-07 13:27:43,639 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_357|], 2=[|v_#memory_$Pointer$.offset_343|]} [2019-12-07 13:27:43,642 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 13:27:43,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,663 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 13:27:43,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:43,668 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 13:27:43,782 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_356|], 20=[|v_#memory_$Pointer$.offset_359|]} [2019-12-07 13:27:43,785 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 13:27:43,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,820 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 13:27:43,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:43,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:43,830 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 13:27:44,394 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_357|], 1=[|v_#memory_$Pointer$.offset_360|]} [2019-12-07 13:27:44,397 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 13:27:44,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:44,441 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 13:27:44,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:44,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:44,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 13:27:46,636 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_358|], 1=[|v_#memory_$Pointer$.offset_361|], 2=[|v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_342|]} [2019-12-07 13:27:46,644 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 13:27:46,774 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:27:46,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:46,778 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 13:27:46,898 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 13:27:46,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:46,901 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 13:27:46,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:46,965 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 13:27:46,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:46,982 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:46,982 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 13:27:50,067 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_359|], 1=[|v_#memory_$Pointer$.offset_362|]} [2019-12-07 13:27:50,070 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 13:27:50,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:50,165 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 13:27:50,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:50,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:50,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:279, output treesize:278 [2019-12-07 13:27:54,653 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_360|], 1=[|v_#memory_$Pointer$.offset_363|]} [2019-12-07 13:27:54,656 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 13:27:54,759 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 13:27:54,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:54,761 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 13:27:54,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:54,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-12-07 13:27:54,779 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:319, output treesize:318 [2019-12-07 13:27:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073665559] [2019-12-07 13:27:59,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:27:59,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2019-12-07 13:27:59,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275424289] [2019-12-07 13:27:59,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 13:27:59,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 13:27:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=208, Unknown=2, NotChecked=0, Total=272 [2019-12-07 13:27:59,515 INFO L87 Difference]: Start difference. First operand 1812 states and 2440 transitions. Second operand 17 states. [2019-12-07 13:30:01,988 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-07 13:30:20,523 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-12-07 13:32:13,398 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 13:33:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:04,611 INFO L93 Difference]: Finished difference Result 3712 states and 4980 transitions. [2019-12-07 13:33:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:33:04,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2019-12-07 13:33:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:04,615 INFO L225 Difference]: With dead ends: 3712 [2019-12-07 13:33:04,615 INFO L226 Difference]: Without dead ends: 1943 [2019-12-07 13:33:04,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=164, Invalid=368, Unknown=20, NotChecked=0, Total=552 [2019-12-07 13:33:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-07 13:33:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1614. [2019-12-07 13:33:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2019-12-07 13:33:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2182 transitions. [2019-12-07 13:33:04,673 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2182 transitions. Word has length 173 [2019-12-07 13:33:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:04,673 INFO L462 AbstractCegarLoop]: Abstraction has 1614 states and 2182 transitions. [2019-12-07 13:33:04,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 13:33:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2182 transitions. [2019-12-07 13:33:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:33:04,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:04,674 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, 1, 1, 1] [2019-12-07 13:33:04,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 13:33:04,875 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1106098171, now seen corresponding path program 1 times [2019-12-07 13:33:04,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:33:04,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398945889] [2019-12-07 13:33:04,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:33:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:05,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 13:33:05,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:05,271 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 13:33:05,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,450 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 13:33:05,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,452 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_366|], 2=[|v_#memory_$Pointer$.base_363|, |v_#memory_$Pointer$.base_362|]} [2019-12-07 13:33:05,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,505 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 13:33:05,505 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,608 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 13:33:05,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,628 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 13:33:05,629 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,676 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 13:33:05,676 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,690 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 13:33:05,691 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 13:33:05,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,700 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 13:33:05,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:05,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,709 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 13:33:05,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:05,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,723 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 13:33:05,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,737 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 13:33:05,738 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:33:05,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,747 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 13:33:05,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,753 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:05,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,756 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 13:33:05,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:05,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,771 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 13:33:05,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:05,786 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 13:33:05,786 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,791 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:33:05,793 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_413|], 2=[|v_#memory_$Pointer$.offset_365|, |v_#memory_$Pointer$.base_373|]} [2019-12-07 13:33:05,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 13:33:05,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,839 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 13:33:05,839 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,889 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 83 treesize of output 119 [2019-12-07 13:33:05,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:05,892 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,917 INFO L614 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-12-07 13:33:05,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,918 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:143, output treesize:35 [2019-12-07 13:33:05,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 7 [2019-12-07 13:33:05,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,942 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 8 treesize of output 4 [2019-12-07 13:33:05,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:05,943 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 13:33:05,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:05,944 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2019-12-07 13:33:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 13:33:06,004 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:06,045 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_370|, |v_#memory_$Pointer$.base_378|, |#memory_$Pointer$.offset|]} [2019-12-07 13:33:06,068 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 58 treesize of output 40 [2019-12-07 13:33:06,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:33:06,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:06,111 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 13:33:06,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:06,139 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 13:33:06,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:06,166 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 61 treesize of output 43 [2019-12-07 13:33:06,166 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:06,172 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 43 treesize of output 37 [2019-12-07 13:33:06,173 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 13:33:06,214 INFO L614 ElimStorePlain]: treesize reduction 10, result has 84.8 percent of original size [2019-12-07 13:33:06,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 13:33:06,215 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2019-12-07 13:33:08,247 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-12-07 13:33:08,252 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 13:33:08,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,264 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 13:33:08,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:33:08,267 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 13:33:08,284 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 13:33:08,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,287 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:33:08,287 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:33:08,299 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 13:33:08,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:33:08,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:33:08,316 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 13:33:08,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,329 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 13:33:08,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:33:08,332 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 13:33:08,345 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 13:33:08,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:33:08,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:33:08,362 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 13:33:08,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:08,365 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:33:08,365 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:33:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 13:33:08,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398945889] [2019-12-07 13:33:08,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:33:08,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 13:33:08,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011201178] [2019-12-07 13:33:08,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:33:08,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:33:08,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:33:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:33:08,423 INFO L87 Difference]: Start difference. First operand 1614 states and 2182 transitions. Second operand 8 states. [2019-12-07 13:33:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:33:18,313 INFO L93 Difference]: Finished difference Result 4612 states and 6258 transitions. [2019-12-07 13:33:18,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:33:18,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-12-07 13:33:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:33:18,318 INFO L225 Difference]: With dead ends: 4612 [2019-12-07 13:33:18,318 INFO L226 Difference]: Without dead ends: 3041 [2019-12-07 13:33:18,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 372 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:33:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-12-07 13:33:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2920. [2019-12-07 13:33:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-12-07 13:33:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 3999 transitions. [2019-12-07 13:33:18,399 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 3999 transitions. Word has length 193 [2019-12-07 13:33:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:33:18,399 INFO L462 AbstractCegarLoop]: Abstraction has 2920 states and 3999 transitions. [2019-12-07 13:33:18,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:33:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3999 transitions. [2019-12-07 13:33:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:33:18,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:33:18,407 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, 1, 1, 1] [2019-12-07 13:33:18,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 13:33:18,608 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:33:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:33:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash 482816569, now seen corresponding path program 1 times [2019-12-07 13:33:18,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:33:18,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502265094] [2019-12-07 13:33:18,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:33:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:19,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 13:33:19,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:33:19,108 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 13:33:19,108 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,304 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 13:33:19,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,306 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_393|], 2=[|v_#memory_$Pointer$.base_387|, |v_#memory_$Pointer$.base_386|]} [2019-12-07 13:33:19,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,357 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 13:33:19,357 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,465 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 13:33:19,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,483 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 13:33:19,483 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,533 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 13:33:19,533 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,547 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 13:33:19,548 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 13:33:19,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,556 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 13:33:19,557 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,562 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:19,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,565 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 13:33:19,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,570 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,570 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,570 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:19,572 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 13:33:19,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,598 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 13:33:19,599 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,607 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:33:19,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,611 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 13:33:19,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:19,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,618 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 13:33:19,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,623 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:33:19,626 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 13:33:19,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,653 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 13:33:19,653 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,662 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:33:19,663 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_380|], 2=[|v_#memory_$Pointer$.base_400|]} [2019-12-07 13:33:19,666 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 13:33:19,666 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 13:33:19,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,721 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 13:33:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:33:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:19,722 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 13:33:19,746 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 13:33:19,747 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,747 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 13:33:19,749 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 13:33:19,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,771 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 13:33:19,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,781 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:33:19,784 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_381|], 2=[|v_#memory_$Pointer$.base_402|]} [2019-12-07 13:33:19,786 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 13:33:19,786 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 13:33:19,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:19,834 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 13:33:19,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:19,834 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,849 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 13:33:19,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:19,850 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 13:33:19,852 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_426|, |v_#memory_$Pointer$.offset_382|], 2=[|v_#memory_$Pointer$.base_391|, |v_#memory_$Pointer$.base_403|, |v_#memory_$Pointer$.offset_378|], 6=[|v_#memory_$Pointer$.offset_379|, |v_#memory_$Pointer$.base_392|]} [2019-12-07 13:33:19,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:19,967 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 13:33:19,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:20,718 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 13:33:20,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:20,760 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 13:33:20,760 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:21,137 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 13:33:21,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:21,145 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 13:33:21,516 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 13:33:21,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:21,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:21,600 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 13:33:21,600 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:21,802 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 13:33:21,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:21,809 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 13:33:22,063 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 13:33:22,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:22,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:22,069 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 13:33:22,069 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:22,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:22,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:38,437 WARN L192 SmtUtils]: Spent 16.29 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 13:33:38,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:38,437 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 130 treesize of output 168 [2019-12-07 13:33:38,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:38,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:38,438 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:38,500 INFO L614 ElimStorePlain]: treesize reduction 86, result has 53.0 percent of original size [2019-12-07 13:33:38,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:33:38,501 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:55 [2019-12-07 13:33:38,528 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_404|, |v_#memory_$Pointer$.offset_383|], 12=[|v_#memory_int_427|]} [2019-12-07 13:33:38,530 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 65 treesize of output 47 [2019-12-07 13:33:38,531 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 13:33:38,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:38,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 31 [2019-12-07 13:33:38,561 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 13:33:38,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:38,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:33:38,587 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 49 treesize of output 39 [2019-12-07 13:33:38,588 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:38,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:38,602 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 13:33:38,602 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:35 [2019-12-07 13:33:38,636 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 31 treesize of output 13 [2019-12-07 13:33:38,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:38,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:38,641 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 13:33:38,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 13:33:38,799 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 13:33:38,799 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:33:38,837 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_391|, |v_#memory_$Pointer$.base_406|, |v_#memory_$Pointer$.offset_385|, |v_#memory_$Pointer$.offset_378|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_379|, |v_#memory_$Pointer$.base_392|]} [2019-12-07 13:33:38,890 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 13:33:38,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:39,298 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 13:33:39,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:39,317 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 13:33:39,812 WARN L192 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 13:33:39,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:39,819 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 13:33:40,011 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:33:40,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:40,017 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 13:33:40,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:40,110 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 13:33:40,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:40,167 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 850 treesize of output 766 [2019-12-07 13:33:40,168 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:33:40,405 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 13:33:40,405 INFO L614 ElimStorePlain]: treesize reduction 371, result has 36.5 percent of original size [2019-12-07 13:33:40,459 INFO L343 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2019-12-07 13:33:40,459 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 91 treesize of output 105 [2019-12-07 13:33:40,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:40,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:33:40,495 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 85 treesize of output 85 [2019-12-07 13:33:40,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:33:40,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:33:40,506 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_164], 1=[v_arrayElimCell_165]} [2019-12-07 13:33:40,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502265094] [2019-12-07 13:33:40,519 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6f6f0270 [2019-12-07 13:33:40,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [800725690] [2019-12-07 13:33:40,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:33:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:42,514 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 13:33:42,514 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6f6f0270 [2019-12-07 13:33:42,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127266448] [2019-12-07 13:33:42,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29713911-e023-4614-9be3-855ec32ff89b/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 13:33:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:33:42,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 13:33:42,859 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6f6f0270 [2019-12-07 13:33:42,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:33:42,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 13:33:42,859 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 13:33:42,860 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:33:43,464 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 13:33:43,506 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 13:33:43,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:33:43 BoogieIcfgContainer [2019-12-07 13:33:43,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:33:43,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:33:43,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:33:43,507 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:33:43,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:23:30" (3/4) ... [2019-12-07 13:33:43,510 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:33:43,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:33:43,511 INFO L168 Benchmark]: Toolchain (without parser) took 615476.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 948.4 MB in the beginning and 977.3 MB in the end (delta: -28.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:43,511 INFO L168 Benchmark]: CDTParser took 0.18 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 13:33:43,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:43,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.32 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 13:33:43,512 INFO L168 Benchmark]: Boogie Preprocessor took 54.41 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: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:43,512 INFO L168 Benchmark]: RCFGBuilder took 1694.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.0 MB in the end (delta: 100.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:43,512 INFO L168 Benchmark]: TraceAbstraction took 613189.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Free memory was 973.2 MB in the beginning and 977.3 MB in the end (delta: -4.1 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:43,512 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.2 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:33:43,513 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.32 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.41 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: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1694.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.0 MB in the end (delta: 100.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 613189.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Free memory was 973.2 MB in the beginning and 977.3 MB in the end (delta: -4.1 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.2 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1774]: 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 [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] 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 [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] 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 [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] 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 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND FALSE !(s->options & 2097152UL) [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 0 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND FALSE !((s->s3)->tmp.use_rsa_tmp) [L1390] COND FALSE !(l & 30UL) [L1393] COND FALSE !(l & 1UL) [L1424] skip = 1 [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] 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 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND FALSE !(blastFlag == 4) [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] 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 [L1490] COND FALSE !(num1 > 0L) [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] 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 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND FALSE !(blastFlag == 15) [L1580] COND FALSE !(blastFlag == 18) [L1774] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 159 locations, 1 error locations. Result: UNKNOWN, OverallTime: 613.1s, OverallIterations: 38, TraceHistogramMax: 7, AutomataDifference: 529.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6653 SDtfs, 7934 SDslu, 17532 SDs, 0 SdLazy, 14637 SolverSat, 2462 SolverUnsat, 132 SolverUnknown, 0 SolverNotchecked, 476.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8936 GetRequests, 8701 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 56.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2920occurred 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.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 5048 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 43.8s InterpolantComputationTime, 4470 NumberOfCodeBlocks, 4470 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8866 ConstructedInterpolants, 209 QuantifiedInterpolants, 6899747 SizeOfPredicates, 137 NumberOfNonLiveVariables, 10722 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 74 InterpolantComputations, 72 PerfectInterpolantSequences, 8527/8858 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...