./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/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 221d8ee995a69c986b355f515c858471b19e54a2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/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 221d8ee995a69c986b355f515c858471b19e54a2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:43,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:43,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:43,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:43,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:43,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:43,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:43,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:43,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:43,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:43,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:43,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:43,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:43,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:43,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:43,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:43,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:43,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:43,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:43,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:43,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:43,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:43,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:43,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:43,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:43,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:43,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:43,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:43,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:43,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:43,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:43,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:43,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:43,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:43,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:43,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:43,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:43,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:43,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:43,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:43,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:43,216 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:37:43,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:43,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:43,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:43,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:43,231 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:43,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:43,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:43,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:37:43,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:43,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:43,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:43,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:43,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:43,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:43,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:43,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:43,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:43,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:43,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:43,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:43,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:43,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:43,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:43,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:43,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:43,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:37:43,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:37:43,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:43,237 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_c0f2634f-8016-460a-a77d-f872e5a1a2a9/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-11-16 00:37:43,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:43,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:43,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:43,287 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:43,287 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:43,288 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-16 00:37:43,336 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/0aa054f97/314f6c93261f40a78d61a7eb19fcf79e/FLAG093116366 [2019-11-16 00:37:43,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:43,837 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-16 00:37:43,860 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/0aa054f97/314f6c93261f40a78d61a7eb19fcf79e/FLAG093116366 [2019-11-16 00:37:44,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/0aa054f97/314f6c93261f40a78d61a7eb19fcf79e [2019-11-16 00:37:44,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:44,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:44,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:44,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:44,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:44,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4919a875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44, skipping insertion in model container [2019-11-16 00:37:44,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,077 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:44,145 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:44,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:44,690 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:44,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:44,795 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:44,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44 WrapperNode [2019-11-16 00:37:44,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:44,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:44,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:44,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:44,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:44,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:44,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:44,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:44,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:44,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:45,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:45,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... [2019-11-16 00:37:45,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:45,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:45,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:45,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:45,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:37:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:37:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:37:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:37:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:37:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:45,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:45,338 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:37:46,216 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:37:46,217 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:37:46,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:46,221 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:37:46,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:46 BoogieIcfgContainer [2019-11-16 00:37:46,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:46,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:46,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:46,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:46,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:44" (1/3) ... [2019-11-16 00:37:46,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272077ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:46, skipping insertion in model container [2019-11-16 00:37:46,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:44" (2/3) ... [2019-11-16 00:37:46,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272077ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:46, skipping insertion in model container [2019-11-16 00:37:46,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:46" (3/3) ... [2019-11-16 00:37:46,236 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-11-16 00:37:46,246 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:46,263 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:37:46,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:37:46,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:46,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:37:46,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:46,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:46,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:46,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:46,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:46,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-16 00:37:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:37:46,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:46,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:46,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2019-11-16 00:37:46,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:46,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051787633] [2019-11-16 00:37:46,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:46,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051787633] [2019-11-16 00:37:46,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:46,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:46,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80919009] [2019-11-16 00:37:46,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:46,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:46,713 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-16 00:37:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,217 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-11-16 00:37:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:47,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-16 00:37:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,231 INFO L225 Difference]: With dead ends: 329 [2019-11-16 00:37:47,231 INFO L226 Difference]: Without dead ends: 166 [2019-11-16 00:37:47,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-16 00:37:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-16 00:37:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-11-16 00:37:47,291 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 43 [2019-11-16 00:37:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,292 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-11-16 00:37:47,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-11-16 00:37:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:37:47,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,302 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,302 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1905377872, now seen corresponding path program 1 times [2019-11-16 00:37:47,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49325527] [2019-11-16 00:37:47,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:47,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49325527] [2019-11-16 00:37:47,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:47,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293029787] [2019-11-16 00:37:47,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:47,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:47,466 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 4 states. [2019-11-16 00:37:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,851 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-11-16 00:37:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:47,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:37:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,854 INFO L225 Difference]: With dead ends: 296 [2019-11-16 00:37:47,854 INFO L226 Difference]: Without dead ends: 166 [2019-11-16 00:37:47,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-16 00:37:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-16 00:37:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-11-16 00:37:47,867 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 56 [2019-11-16 00:37:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,867 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-11-16 00:37:47,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-11-16 00:37:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:37:47,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,870 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1255882526, now seen corresponding path program 1 times [2019-11-16 00:37:47,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833372620] [2019-11-16 00:37:47,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:48,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833372620] [2019-11-16 00:37:48,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:48,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:48,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773333528] [2019-11-16 00:37:48,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:48,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:48,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:48,052 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 4 states. [2019-11-16 00:37:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:48,383 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2019-11-16 00:37:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:48,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-16 00:37:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:48,385 INFO L225 Difference]: With dead ends: 295 [2019-11-16 00:37:48,385 INFO L226 Difference]: Without dead ends: 165 [2019-11-16 00:37:48,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-16 00:37:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-11-16 00:37:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-11-16 00:37:48,395 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 57 [2019-11-16 00:37:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:48,395 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-11-16 00:37:48,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-11-16 00:37:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:37:48,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:48,397 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:48,397 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2070651149, now seen corresponding path program 1 times [2019-11-16 00:37:48,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:48,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369056701] [2019-11-16 00:37:48,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:48,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369056701] [2019-11-16 00:37:48,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:48,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:48,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120346705] [2019-11-16 00:37:48,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:48,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:48,494 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 4 states. [2019-11-16 00:37:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:48,808 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2019-11-16 00:37:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:48,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-16 00:37:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:48,810 INFO L225 Difference]: With dead ends: 293 [2019-11-16 00:37:48,810 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:37:48,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:37:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-11-16 00:37:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2019-11-16 00:37:48,818 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 57 [2019-11-16 00:37:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:48,818 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2019-11-16 00:37:48,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2019-11-16 00:37:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:37:48,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:48,825 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:48,825 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -221095859, now seen corresponding path program 1 times [2019-11-16 00:37:48,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:48,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61950904] [2019-11-16 00:37:48,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:48,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61950904] [2019-11-16 00:37:48,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:48,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:48,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734501450] [2019-11-16 00:37:48,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:48,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:48,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:48,925 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand 4 states. [2019-11-16 00:37:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,245 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2019-11-16 00:37:49,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:49,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-16 00:37:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,247 INFO L225 Difference]: With dead ends: 292 [2019-11-16 00:37:49,247 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:37:49,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:37:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-16 00:37:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2019-11-16 00:37:49,255 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 57 [2019-11-16 00:37:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2019-11-16 00:37:49,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2019-11-16 00:37:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:37:49,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,265 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:49,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 631020918, now seen corresponding path program 1 times [2019-11-16 00:37:49,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888051769] [2019-11-16 00:37:49,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:49,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888051769] [2019-11-16 00:37:49,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:49,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:49,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141356845] [2019-11-16 00:37:49,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:49,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:49,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:49,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:49,348 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand 4 states. [2019-11-16 00:37:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,655 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-11-16 00:37:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:49,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-16 00:37:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,658 INFO L225 Difference]: With dead ends: 292 [2019-11-16 00:37:49,658 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:37:49,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:37:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-16 00:37:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-11-16 00:37:49,665 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 57 [2019-11-16 00:37:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,666 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-11-16 00:37:49,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-11-16 00:37:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:37:49,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,667 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:49,667 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1772080409, now seen corresponding path program 1 times [2019-11-16 00:37:49,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316641651] [2019-11-16 00:37:49,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:49,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316641651] [2019-11-16 00:37:49,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:49,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:49,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256523466] [2019-11-16 00:37:49,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:49,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:49,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:49,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:49,720 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 4 states. [2019-11-16 00:37:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,977 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-11-16 00:37:49,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:49,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-16 00:37:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,978 INFO L225 Difference]: With dead ends: 292 [2019-11-16 00:37:49,978 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:37:49,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:37:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-16 00:37:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-11-16 00:37:49,989 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 58 [2019-11-16 00:37:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,989 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-11-16 00:37:49,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-11-16 00:37:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:37:49,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,990 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:49,990 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash -245018341, now seen corresponding path program 1 times [2019-11-16 00:37:49,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530086663] [2019-11-16 00:37:49,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:50,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530086663] [2019-11-16 00:37:50,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621144942] [2019-11-16 00:37:50,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,041 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-11-16 00:37:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:50,377 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2019-11-16 00:37:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:50,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-16 00:37:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:50,379 INFO L225 Difference]: With dead ends: 292 [2019-11-16 00:37:50,379 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:37:50,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:37:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-16 00:37:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-11-16 00:37:50,384 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 59 [2019-11-16 00:37:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:50,385 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-11-16 00:37:50,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-11-16 00:37:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:37:50,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:50,386 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:50,386 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:50,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1380774754, now seen corresponding path program 1 times [2019-11-16 00:37:50,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:50,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409032893] [2019-11-16 00:37:50,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:50,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409032893] [2019-11-16 00:37:50,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467138280] [2019-11-16 00:37:50,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,467 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-11-16 00:37:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:50,718 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2019-11-16 00:37:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:50,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-16 00:37:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:50,720 INFO L225 Difference]: With dead ends: 282 [2019-11-16 00:37:50,720 INFO L226 Difference]: Without dead ends: 152 [2019-11-16 00:37:50,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-16 00:37:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-11-16 00:37:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:37:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-16 00:37:50,725 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 60 [2019-11-16 00:37:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:50,726 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-16 00:37:50,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-16 00:37:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:37:50,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:50,727 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:50,727 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:50,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1992648186, now seen corresponding path program 1 times [2019-11-16 00:37:50,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:50,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252702841] [2019-11-16 00:37:50,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:50,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252702841] [2019-11-16 00:37:50,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528865224] [2019-11-16 00:37:50,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,783 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-11-16 00:37:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,111 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2019-11-16 00:37:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:51,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-16 00:37:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,113 INFO L225 Difference]: With dead ends: 322 [2019-11-16 00:37:51,113 INFO L226 Difference]: Without dead ends: 192 [2019-11-16 00:37:51,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-16 00:37:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-16 00:37:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2019-11-16 00:37:51,119 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 60 [2019-11-16 00:37:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,120 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2019-11-16 00:37:51,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2019-11-16 00:37:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:37:51,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,121 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:51,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1514156125, now seen corresponding path program 1 times [2019-11-16 00:37:51,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781887065] [2019-11-16 00:37:51,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:51,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781887065] [2019-11-16 00:37:51,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:51,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:51,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598316487] [2019-11-16 00:37:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:51,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:51,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:51,191 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand 4 states. [2019-11-16 00:37:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,502 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-11-16 00:37:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:51,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-16 00:37:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,504 INFO L225 Difference]: With dead ends: 344 [2019-11-16 00:37:51,504 INFO L226 Difference]: Without dead ends: 192 [2019-11-16 00:37:51,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-16 00:37:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-16 00:37:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2019-11-16 00:37:51,511 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 73 [2019-11-16 00:37:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,513 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2019-11-16 00:37:51,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2019-11-16 00:37:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:37:51,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,514 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:51,514 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 112745967, now seen corresponding path program 1 times [2019-11-16 00:37:51,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614343882] [2019-11-16 00:37:51,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:51,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614343882] [2019-11-16 00:37:51,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:51,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:51,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082469468] [2019-11-16 00:37:51,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:51,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:51,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:51,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:51,570 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand 4 states. [2019-11-16 00:37:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,892 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-11-16 00:37:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:51,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:37:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,894 INFO L225 Difference]: With dead ends: 343 [2019-11-16 00:37:51,894 INFO L226 Difference]: Without dead ends: 191 [2019-11-16 00:37:51,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-16 00:37:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-11-16 00:37:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-11-16 00:37:51,900 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 74 [2019-11-16 00:37:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,900 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-11-16 00:37:51,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-11-16 00:37:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:37:51,901 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,901 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:51,901 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash -855687654, now seen corresponding path program 1 times [2019-11-16 00:37:51,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838786734] [2019-11-16 00:37:51,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:51,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838786734] [2019-11-16 00:37:51,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:51,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:51,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928069485] [2019-11-16 00:37:51,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:51,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:51,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:51,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:51,948 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 4 states. [2019-11-16 00:37:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:52,303 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-11-16 00:37:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:52,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:37:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:52,305 INFO L225 Difference]: With dead ends: 341 [2019-11-16 00:37:52,305 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:37:52,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:37:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-11-16 00:37:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2019-11-16 00:37:52,310 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 74 [2019-11-16 00:37:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:52,311 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2019-11-16 00:37:52,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2019-11-16 00:37:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:37:52,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:52,312 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:52,312 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1147532634, now seen corresponding path program 1 times [2019-11-16 00:37:52,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:52,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084946364] [2019-11-16 00:37:52,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:52,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084946364] [2019-11-16 00:37:52,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:52,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351273069] [2019-11-16 00:37:52,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:52,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:52,365 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand 4 states. [2019-11-16 00:37:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:52,688 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2019-11-16 00:37:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:52,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:37:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:52,691 INFO L225 Difference]: With dead ends: 340 [2019-11-16 00:37:52,691 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:37:52,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:37:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-16 00:37:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2019-11-16 00:37:52,698 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 74 [2019-11-16 00:37:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:52,699 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2019-11-16 00:37:52,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2019-11-16 00:37:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:37:52,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:52,700 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:52,701 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1999649411, now seen corresponding path program 1 times [2019-11-16 00:37:52,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:52,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204952464] [2019-11-16 00:37:52,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:52,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204952464] [2019-11-16 00:37:52,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:52,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900037217] [2019-11-16 00:37:52,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:52,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:52,786 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand 4 states. [2019-11-16 00:37:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,133 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2019-11-16 00:37:53,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:53,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:37:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,135 INFO L225 Difference]: With dead ends: 340 [2019-11-16 00:37:53,135 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:37:53,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:37:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-16 00:37:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2019-11-16 00:37:53,141 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 74 [2019-11-16 00:37:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,141 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2019-11-16 00:37:53,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2019-11-16 00:37:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:37:53,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,142 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:53,142 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1249890732, now seen corresponding path program 1 times [2019-11-16 00:37:53,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810390899] [2019-11-16 00:37:53,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:53,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810390899] [2019-11-16 00:37:53,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:53,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542559183] [2019-11-16 00:37:53,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:53,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:53,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:53,182 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand 4 states. [2019-11-16 00:37:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,501 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2019-11-16 00:37:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:53,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-16 00:37:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,504 INFO L225 Difference]: With dead ends: 340 [2019-11-16 00:37:53,504 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:37:53,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:37:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-16 00:37:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-11-16 00:37:53,509 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 75 [2019-11-16 00:37:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,510 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-11-16 00:37:53,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-11-16 00:37:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:37:53,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,511 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:53,513 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 746970856, now seen corresponding path program 1 times [2019-11-16 00:37:53,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080622158] [2019-11-16 00:37:53,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:53,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080622158] [2019-11-16 00:37:53,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:53,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355135375] [2019-11-16 00:37:53,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:53,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:53,560 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-11-16 00:37:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,885 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2019-11-16 00:37:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:53,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-16 00:37:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,887 INFO L225 Difference]: With dead ends: 340 [2019-11-16 00:37:53,887 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:37:53,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:37:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-16 00:37:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-11-16 00:37:53,892 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 76 [2019-11-16 00:37:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,893 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-11-16 00:37:53,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-11-16 00:37:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:37:53,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,894 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:53,894 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -693880719, now seen corresponding path program 1 times [2019-11-16 00:37:53,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061790422] [2019-11-16 00:37:53,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:53,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061790422] [2019-11-16 00:37:53,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:53,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344374089] [2019-11-16 00:37:53,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:53,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:53,963 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-11-16 00:37:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:54,242 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-16 00:37:54,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:54,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-16 00:37:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:54,244 INFO L225 Difference]: With dead ends: 330 [2019-11-16 00:37:54,244 INFO L226 Difference]: Without dead ends: 178 [2019-11-16 00:37:54,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-16 00:37:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2019-11-16 00:37:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:37:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-11-16 00:37:54,249 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 77 [2019-11-16 00:37:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:54,249 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-11-16 00:37:54,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-11-16 00:37:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:37:54,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:54,250 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:54,251 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -242622967, now seen corresponding path program 1 times [2019-11-16 00:37:54,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:54,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556841338] [2019-11-16 00:37:54,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:54,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556841338] [2019-11-16 00:37:54,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:54,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:54,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557919111] [2019-11-16 00:37:54,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:54,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:54,322 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-11-16 00:37:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:54,792 INFO L93 Difference]: Finished difference Result 432 states and 655 transitions. [2019-11-16 00:37:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:54,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-16 00:37:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:54,794 INFO L225 Difference]: With dead ends: 432 [2019-11-16 00:37:54,795 INFO L226 Difference]: Without dead ends: 280 [2019-11-16 00:37:54,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-16 00:37:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 212. [2019-11-16 00:37:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-16 00:37:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2019-11-16 00:37:54,802 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 82 [2019-11-16 00:37:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:54,802 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2019-11-16 00:37:54,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2019-11-16 00:37:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:37:54,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:54,803 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:54,804 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 181023755, now seen corresponding path program 1 times [2019-11-16 00:37:54,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:54,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309954850] [2019-11-16 00:37:54,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:54,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309954850] [2019-11-16 00:37:54,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:54,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:54,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950738632] [2019-11-16 00:37:54,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:54,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:54,863 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand 4 states. [2019-11-16 00:37:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,257 INFO L93 Difference]: Finished difference Result 454 states and 709 transitions. [2019-11-16 00:37:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:55,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-16 00:37:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,259 INFO L225 Difference]: With dead ends: 454 [2019-11-16 00:37:55,259 INFO L226 Difference]: Without dead ends: 261 [2019-11-16 00:37:55,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-16 00:37:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 236. [2019-11-16 00:37:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-16 00:37:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2019-11-16 00:37:55,266 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 82 [2019-11-16 00:37:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,266 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2019-11-16 00:37:55,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2019-11-16 00:37:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:37:55,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,269 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:55,269 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash -910969721, now seen corresponding path program 1 times [2019-11-16 00:37:55,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:55,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964792616] [2019-11-16 00:37:55,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:55,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964792616] [2019-11-16 00:37:55,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:55,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:55,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453902120] [2019-11-16 00:37:55,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:55,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:55,354 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand 4 states. [2019-11-16 00:37:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,673 INFO L93 Difference]: Finished difference Result 513 states and 801 transitions. [2019-11-16 00:37:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:55,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-16 00:37:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,675 INFO L225 Difference]: With dead ends: 513 [2019-11-16 00:37:55,675 INFO L226 Difference]: Without dead ends: 296 [2019-11-16 00:37:55,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-16 00:37:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2019-11-16 00:37:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:37:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2019-11-16 00:37:55,682 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 83 [2019-11-16 00:37:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,683 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2019-11-16 00:37:55,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2019-11-16 00:37:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:55,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,684 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:55,684 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash 83388544, now seen corresponding path program 1 times [2019-11-16 00:37:55,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:55,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419750993] [2019-11-16 00:37:55,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:55,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419750993] [2019-11-16 00:37:55,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:55,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:55,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946163999] [2019-11-16 00:37:55,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:55,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:55,752 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand 4 states. [2019-11-16 00:37:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,114 INFO L93 Difference]: Finished difference Result 514 states and 801 transitions. [2019-11-16 00:37:56,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:56,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:37:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,118 INFO L225 Difference]: With dead ends: 514 [2019-11-16 00:37:56,118 INFO L226 Difference]: Without dead ends: 296 [2019-11-16 00:37:56,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-16 00:37:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2019-11-16 00:37:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:37:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2019-11-16 00:37:56,125 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 95 [2019-11-16 00:37:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,125 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2019-11-16 00:37:56,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2019-11-16 00:37:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:56,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,127 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:56,127 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash 959407550, now seen corresponding path program 1 times [2019-11-16 00:37:56,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:56,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555874078] [2019-11-16 00:37:56,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:56,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555874078] [2019-11-16 00:37:56,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:56,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018215245] [2019-11-16 00:37:56,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:56,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:56,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,194 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand 4 states. [2019-11-16 00:37:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,512 INFO L93 Difference]: Finished difference Result 480 states and 750 transitions. [2019-11-16 00:37:56,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:56,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:37:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,514 INFO L225 Difference]: With dead ends: 480 [2019-11-16 00:37:56,514 INFO L226 Difference]: Without dead ends: 262 [2019-11-16 00:37:56,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-16 00:37:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2019-11-16 00:37:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:37:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2019-11-16 00:37:56,520 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 95 [2019-11-16 00:37:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,520 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2019-11-16 00:37:56,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2019-11-16 00:37:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:56,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,522 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:56,522 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1902976846, now seen corresponding path program 1 times [2019-11-16 00:37:56,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:56,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9790196] [2019-11-16 00:37:56,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:56,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9790196] [2019-11-16 00:37:56,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:56,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656792389] [2019-11-16 00:37:56,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:56,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,584 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand 4 states. [2019-11-16 00:37:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:57,049 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-11-16 00:37:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:57,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:57,051 INFO L225 Difference]: With dead ends: 513 [2019-11-16 00:37:57,052 INFO L226 Difference]: Without dead ends: 295 [2019-11-16 00:37:57,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-16 00:37:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-11-16 00:37:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:37:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2019-11-16 00:37:57,058 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 96 [2019-11-16 00:37:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:57,060 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2019-11-16 00:37:57,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2019-11-16 00:37:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:57,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:57,062 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:57,062 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1423556829, now seen corresponding path program 1 times [2019-11-16 00:37:57,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:57,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829088270] [2019-11-16 00:37:57,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:57,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829088270] [2019-11-16 00:37:57,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:57,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:57,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634528524] [2019-11-16 00:37:57,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:57,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:57,125 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand 4 states. [2019-11-16 00:37:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:57,497 INFO L93 Difference]: Finished difference Result 511 states and 792 transitions. [2019-11-16 00:37:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:57,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:57,513 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:37:57,514 INFO L226 Difference]: Without dead ends: 293 [2019-11-16 00:37:57,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-16 00:37:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2019-11-16 00:37:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:37:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2019-11-16 00:37:57,521 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 96 [2019-11-16 00:37:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:57,522 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2019-11-16 00:37:57,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2019-11-16 00:37:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:57,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:57,524 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:57,524 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -868190179, now seen corresponding path program 1 times [2019-11-16 00:37:57,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:57,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861446245] [2019-11-16 00:37:57,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:57,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-11-16 00:37:57,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861446245] [2019-11-16 00:37:57,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:57,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:57,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869890521] [2019-11-16 00:37:57,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:57,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:57,591 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand 4 states. [2019-11-16 00:37:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,077 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2019-11-16 00:37:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:58,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,080 INFO L225 Difference]: With dead ends: 510 [2019-11-16 00:37:58,080 INFO L226 Difference]: Without dead ends: 292 [2019-11-16 00:37:58,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-16 00:37:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 237. [2019-11-16 00:37:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:37:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2019-11-16 00:37:58,086 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 96 [2019-11-16 00:37:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,086 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2019-11-16 00:37:58,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2019-11-16 00:37:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:58,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,090 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,091 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash -16073402, now seen corresponding path program 1 times [2019-11-16 00:37:58,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068636609] [2019-11-16 00:37:58,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:37:58,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068636609] [2019-11-16 00:37:58,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:58,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611043927] [2019-11-16 00:37:58,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:58,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:58,173 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand 5 states. [2019-11-16 00:37:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,622 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2019-11-16 00:37:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:37:58,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-16 00:37:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,624 INFO L225 Difference]: With dead ends: 476 [2019-11-16 00:37:58,624 INFO L226 Difference]: Without dead ends: 258 [2019-11-16 00:37:58,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-16 00:37:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-11-16 00:37:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:37:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2019-11-16 00:37:58,631 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 96 [2019-11-16 00:37:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,631 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2019-11-16 00:37:58,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2019-11-16 00:37:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:58,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,633 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,633 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1484625057, now seen corresponding path program 1 times [2019-11-16 00:37:58,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584187657] [2019-11-16 00:37:58,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:58,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584187657] [2019-11-16 00:37:58,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:58,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162845440] [2019-11-16 00:37:58,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:58,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:58,698 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand 4 states. [2019-11-16 00:37:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,048 INFO L93 Difference]: Finished difference Result 517 states and 790 transitions. [2019-11-16 00:37:59,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:59,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,050 INFO L225 Difference]: With dead ends: 517 [2019-11-16 00:37:59,050 INFO L226 Difference]: Without dead ends: 279 [2019-11-16 00:37:59,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-16 00:37:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-16 00:37:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:37:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-11-16 00:37:59,057 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 96 [2019-11-16 00:37:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,057 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-11-16 00:37:59,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-11-16 00:37:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:59,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,058 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:59,059 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 518595231, now seen corresponding path program 1 times [2019-11-16 00:37:59,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263076003] [2019-11-16 00:37:59,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:59,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263076003] [2019-11-16 00:37:59,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:59,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173174014] [2019-11-16 00:37:59,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:59,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:59,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,120 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-11-16 00:37:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,498 INFO L93 Difference]: Finished difference Result 516 states and 787 transitions. [2019-11-16 00:37:59,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:59,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,501 INFO L225 Difference]: With dead ends: 516 [2019-11-16 00:37:59,501 INFO L226 Difference]: Without dead ends: 278 [2019-11-16 00:37:59,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-16 00:37:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-16 00:37:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:37:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-11-16 00:37:59,511 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 96 [2019-11-16 00:37:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,512 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-11-16 00:37:59,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-11-16 00:37:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:37:59,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,513 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:59,513 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -445614852, now seen corresponding path program 1 times [2019-11-16 00:37:59,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461760283] [2019-11-16 00:37:59,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:59,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461760283] [2019-11-16 00:37:59,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:59,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960273427] [2019-11-16 00:37:59,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:59,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:59,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,570 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-11-16 00:38:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:00,031 INFO L93 Difference]: Finished difference Result 550 states and 834 transitions. [2019-11-16 00:38:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:00,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-16 00:38:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:00,033 INFO L225 Difference]: With dead ends: 550 [2019-11-16 00:38:00,033 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:38:00,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:38:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-11-16 00:38:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-11-16 00:38:00,042 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 97 [2019-11-16 00:38:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:00,042 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-11-16 00:38:00,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-11-16 00:38:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:38:00,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:00,044 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:00,044 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash -404940102, now seen corresponding path program 1 times [2019-11-16 00:38:00,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:00,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315405263] [2019-11-16 00:38:00,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:00,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315405263] [2019-11-16 00:38:00,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:00,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:00,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759105236] [2019-11-16 00:38:00,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:00,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:00,097 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-11-16 00:38:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:00,422 INFO L93 Difference]: Finished difference Result 516 states and 783 transitions. [2019-11-16 00:38:00,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:00,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-16 00:38:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:00,425 INFO L225 Difference]: With dead ends: 516 [2019-11-16 00:38:00,425 INFO L226 Difference]: Without dead ends: 278 [2019-11-16 00:38:00,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-16 00:38:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-16 00:38:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-11-16 00:38:00,434 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 97 [2019-11-16 00:38:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:00,434 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-11-16 00:38:00,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-11-16 00:38:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:38:00,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:00,435 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:00,436 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 65194841, now seen corresponding path program 1 times [2019-11-16 00:38:00,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:00,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411713118] [2019-11-16 00:38:00,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:00,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411713118] [2019-11-16 00:38:00,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:00,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:00,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607672665] [2019-11-16 00:38:00,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:00,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:00,503 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-11-16 00:38:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:00,911 INFO L93 Difference]: Finished difference Result 550 states and 830 transitions. [2019-11-16 00:38:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:00,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-16 00:38:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:00,942 INFO L225 Difference]: With dead ends: 550 [2019-11-16 00:38:00,942 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:38:00,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:38:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-11-16 00:38:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-11-16 00:38:00,953 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 98 [2019-11-16 00:38:00,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:00,953 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-11-16 00:38:00,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-11-16 00:38:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:38:00,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:00,955 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:00,955 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1326112091, now seen corresponding path program 1 times [2019-11-16 00:38:00,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:00,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152456549] [2019-11-16 00:38:00,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:01,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152456549] [2019-11-16 00:38:01,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:01,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:01,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854210994] [2019-11-16 00:38:01,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:01,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,017 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-11-16 00:38:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:01,280 INFO L93 Difference]: Finished difference Result 516 states and 779 transitions. [2019-11-16 00:38:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:01,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-16 00:38:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:01,282 INFO L225 Difference]: With dead ends: 516 [2019-11-16 00:38:01,282 INFO L226 Difference]: Without dead ends: 278 [2019-11-16 00:38:01,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-16 00:38:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-16 00:38:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-11-16 00:38:01,290 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 98 [2019-11-16 00:38:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:01,290 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-11-16 00:38:01,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-11-16 00:38:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:38:01,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:01,292 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:01,292 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash -726636041, now seen corresponding path program 1 times [2019-11-16 00:38:01,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:01,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499967537] [2019-11-16 00:38:01,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:01,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499967537] [2019-11-16 00:38:01,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:01,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:01,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306560714] [2019-11-16 00:38:01,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:01,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,349 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-11-16 00:38:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:01,784 INFO L93 Difference]: Finished difference Result 550 states and 826 transitions. [2019-11-16 00:38:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:01,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-16 00:38:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:01,786 INFO L225 Difference]: With dead ends: 550 [2019-11-16 00:38:01,786 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:38:01,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:38:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-11-16 00:38:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-11-16 00:38:01,794 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 99 [2019-11-16 00:38:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:01,794 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-11-16 00:38:01,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-11-16 00:38:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:38:01,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:01,796 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:01,796 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:01,796 INFO L82 PathProgramCache]: Analyzing trace with hash -292906955, now seen corresponding path program 1 times [2019-11-16 00:38:01,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:01,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888911149] [2019-11-16 00:38:01,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:01,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888911149] [2019-11-16 00:38:01,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:01,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:01,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785379002] [2019-11-16 00:38:01,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:01,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:01,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,857 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-11-16 00:38:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:02,193 INFO L93 Difference]: Finished difference Result 516 states and 775 transitions. [2019-11-16 00:38:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:02,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-16 00:38:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:02,195 INFO L225 Difference]: With dead ends: 516 [2019-11-16 00:38:02,195 INFO L226 Difference]: Without dead ends: 278 [2019-11-16 00:38:02,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-16 00:38:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-16 00:38:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-11-16 00:38:02,203 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 99 [2019-11-16 00:38:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:02,204 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-11-16 00:38:02,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-11-16 00:38:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:38:02,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:02,205 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:02,205 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1049348212, now seen corresponding path program 1 times [2019-11-16 00:38:02,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:02,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791548312] [2019-11-16 00:38:02,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:02,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791548312] [2019-11-16 00:38:02,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:02,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:02,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63368118] [2019-11-16 00:38:02,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:02,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:02,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:02,269 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-11-16 00:38:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:02,643 INFO L93 Difference]: Finished difference Result 540 states and 810 transitions. [2019-11-16 00:38:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:02,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-16 00:38:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:02,646 INFO L225 Difference]: With dead ends: 540 [2019-11-16 00:38:02,646 INFO L226 Difference]: Without dead ends: 302 [2019-11-16 00:38:02,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-16 00:38:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2019-11-16 00:38:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-11-16 00:38:02,654 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 100 [2019-11-16 00:38:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:02,654 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-11-16 00:38:02,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-11-16 00:38:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:38:02,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:02,656 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:02,656 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1610047990, now seen corresponding path program 1 times [2019-11-16 00:38:02,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:02,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241427636] [2019-11-16 00:38:02,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:02,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241427636] [2019-11-16 00:38:02,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:02,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:02,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786893340] [2019-11-16 00:38:02,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:02,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:02,735 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-11-16 00:38:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:03,008 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-16 00:38:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:03,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-16 00:38:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:03,011 INFO L225 Difference]: With dead ends: 506 [2019-11-16 00:38:03,011 INFO L226 Difference]: Without dead ends: 268 [2019-11-16 00:38:03,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-16 00:38:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2019-11-16 00:38:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-11-16 00:38:03,019 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 100 [2019-11-16 00:38:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:03,019 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-11-16 00:38:03,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-11-16 00:38:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:38:03,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:03,021 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:03,021 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1540193984, now seen corresponding path program 1 times [2019-11-16 00:38:03,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:03,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007254796] [2019-11-16 00:38:03,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:03,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007254796] [2019-11-16 00:38:03,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:03,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:03,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770950208] [2019-11-16 00:38:03,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:03,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:03,075 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-11-16 00:38:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:03,511 INFO L93 Difference]: Finished difference Result 540 states and 806 transitions. [2019-11-16 00:38:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:03,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-16 00:38:03,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:03,513 INFO L225 Difference]: With dead ends: 540 [2019-11-16 00:38:03,514 INFO L226 Difference]: Without dead ends: 302 [2019-11-16 00:38:03,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-16 00:38:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2019-11-16 00:38:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:38:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-11-16 00:38:03,521 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 104 [2019-11-16 00:38:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:03,522 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-11-16 00:38:03,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-11-16 00:38:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:38:03,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:03,523 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:03,523 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:03,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1957590590, now seen corresponding path program 1 times [2019-11-16 00:38:03,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:03,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777906985] [2019-11-16 00:38:03,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:03,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777906985] [2019-11-16 00:38:03,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:03,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:03,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976724151] [2019-11-16 00:38:03,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:03,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:03,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:03,607 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2019-11-16 00:38:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:04,019 INFO L93 Difference]: Finished difference Result 547 states and 819 transitions. [2019-11-16 00:38:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:04,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-16 00:38:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:04,022 INFO L225 Difference]: With dead ends: 547 [2019-11-16 00:38:04,022 INFO L226 Difference]: Without dead ends: 309 [2019-11-16 00:38:04,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-16 00:38:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-11-16 00:38:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 426 transitions. [2019-11-16 00:38:04,032 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 426 transitions. Word has length 104 [2019-11-16 00:38:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:04,033 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 426 transitions. [2019-11-16 00:38:04,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 426 transitions. [2019-11-16 00:38:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-16 00:38:04,034 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:04,034 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:04,035 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1642233629, now seen corresponding path program 1 times [2019-11-16 00:38:04,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:04,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287358180] [2019-11-16 00:38:04,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:04,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287358180] [2019-11-16 00:38:04,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:04,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:04,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646469678] [2019-11-16 00:38:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:04,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:04,115 INFO L87 Difference]: Start difference. First operand 283 states and 426 transitions. Second operand 4 states. [2019-11-16 00:38:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:04,594 INFO L93 Difference]: Finished difference Result 592 states and 894 transitions. [2019-11-16 00:38:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:04,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-16 00:38:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:04,597 INFO L225 Difference]: With dead ends: 592 [2019-11-16 00:38:04,597 INFO L226 Difference]: Without dead ends: 328 [2019-11-16 00:38:04,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-16 00:38:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 283. [2019-11-16 00:38:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 425 transitions. [2019-11-16 00:38:04,606 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 425 transitions. Word has length 107 [2019-11-16 00:38:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:04,606 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 425 transitions. [2019-11-16 00:38:04,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 425 transitions. [2019-11-16 00:38:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:38:04,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:04,608 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:04,608 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 35471872, now seen corresponding path program 1 times [2019-11-16 00:38:04,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:04,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951481115] [2019-11-16 00:38:04,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:04,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951481115] [2019-11-16 00:38:04,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:04,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:04,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89272767] [2019-11-16 00:38:04,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:04,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:04,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:04,678 INFO L87 Difference]: Start difference. First operand 283 states and 425 transitions. Second operand 4 states. [2019-11-16 00:38:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:05,008 INFO L93 Difference]: Finished difference Result 584 states and 879 transitions. [2019-11-16 00:38:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:05,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-16 00:38:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:05,010 INFO L225 Difference]: With dead ends: 584 [2019-11-16 00:38:05,011 INFO L226 Difference]: Without dead ends: 320 [2019-11-16 00:38:05,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-16 00:38:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-11-16 00:38:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 424 transitions. [2019-11-16 00:38:05,021 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 424 transitions. Word has length 108 [2019-11-16 00:38:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:05,021 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 424 transitions. [2019-11-16 00:38:05,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 424 transitions. [2019-11-16 00:38:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:38:05,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:05,023 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:05,023 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1751499325, now seen corresponding path program 1 times [2019-11-16 00:38:05,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:05,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153646316] [2019-11-16 00:38:05,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:05,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153646316] [2019-11-16 00:38:05,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:05,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:05,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212285347] [2019-11-16 00:38:05,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:05,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:05,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:05,095 INFO L87 Difference]: Start difference. First operand 283 states and 424 transitions. Second operand 4 states. [2019-11-16 00:38:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:05,446 INFO L93 Difference]: Finished difference Result 584 states and 877 transitions. [2019-11-16 00:38:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:05,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-16 00:38:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:05,449 INFO L225 Difference]: With dead ends: 584 [2019-11-16 00:38:05,449 INFO L226 Difference]: Without dead ends: 320 [2019-11-16 00:38:05,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-16 00:38:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-11-16 00:38:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 423 transitions. [2019-11-16 00:38:05,458 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 423 transitions. Word has length 109 [2019-11-16 00:38:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:05,458 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 423 transitions. [2019-11-16 00:38:05,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 423 transitions. [2019-11-16 00:38:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:38:05,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:05,459 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:05,460 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1247479925, now seen corresponding path program 1 times [2019-11-16 00:38:05,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:05,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663488088] [2019-11-16 00:38:05,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:05,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663488088] [2019-11-16 00:38:05,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:05,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:05,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051672848] [2019-11-16 00:38:05,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:05,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:05,534 INFO L87 Difference]: Start difference. First operand 283 states and 423 transitions. Second operand 4 states. [2019-11-16 00:38:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:05,893 INFO L93 Difference]: Finished difference Result 584 states and 875 transitions. [2019-11-16 00:38:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:05,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-16 00:38:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:05,896 INFO L225 Difference]: With dead ends: 584 [2019-11-16 00:38:05,896 INFO L226 Difference]: Without dead ends: 320 [2019-11-16 00:38:05,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-16 00:38:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-11-16 00:38:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 422 transitions. [2019-11-16 00:38:05,906 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 422 transitions. Word has length 110 [2019-11-16 00:38:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:05,909 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 422 transitions. [2019-11-16 00:38:05,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 422 transitions. [2019-11-16 00:38:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:38:05,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:05,910 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:05,910 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1790632826, now seen corresponding path program 1 times [2019-11-16 00:38:05,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:05,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680022757] [2019-11-16 00:38:05,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:05,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680022757] [2019-11-16 00:38:05,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:05,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:05,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129074614] [2019-11-16 00:38:05,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:05,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:05,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:05,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:05,980 INFO L87 Difference]: Start difference. First operand 283 states and 422 transitions. Second operand 4 states. [2019-11-16 00:38:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:06,454 INFO L93 Difference]: Finished difference Result 582 states and 871 transitions. [2019-11-16 00:38:06,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:06,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-16 00:38:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:06,456 INFO L225 Difference]: With dead ends: 582 [2019-11-16 00:38:06,457 INFO L226 Difference]: Without dead ends: 318 [2019-11-16 00:38:06,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-16 00:38:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-11-16 00:38:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 421 transitions. [2019-11-16 00:38:06,465 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 421 transitions. Word has length 110 [2019-11-16 00:38:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:06,466 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 421 transitions. [2019-11-16 00:38:06,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 421 transitions. [2019-11-16 00:38:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-16 00:38:06,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:06,467 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:06,467 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1521793640, now seen corresponding path program 1 times [2019-11-16 00:38:06,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:06,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980625995] [2019-11-16 00:38:06,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:06,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980625995] [2019-11-16 00:38:06,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:06,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:06,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354659867] [2019-11-16 00:38:06,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:06,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:06,531 INFO L87 Difference]: Start difference. First operand 283 states and 421 transitions. Second operand 4 states. [2019-11-16 00:38:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:06,927 INFO L93 Difference]: Finished difference Result 580 states and 866 transitions. [2019-11-16 00:38:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:06,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-16 00:38:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:06,929 INFO L225 Difference]: With dead ends: 580 [2019-11-16 00:38:06,929 INFO L226 Difference]: Without dead ends: 316 [2019-11-16 00:38:06,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-16 00:38:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2019-11-16 00:38:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2019-11-16 00:38:06,939 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 111 [2019-11-16 00:38:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:06,939 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2019-11-16 00:38:06,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2019-11-16 00:38:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-16 00:38:06,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:06,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:06,941 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:06,942 INFO L82 PathProgramCache]: Analyzing trace with hash 244047579, now seen corresponding path program 1 times [2019-11-16 00:38:06,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:06,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494406386] [2019-11-16 00:38:06,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:07,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494406386] [2019-11-16 00:38:07,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:07,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090676021] [2019-11-16 00:38:07,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:07,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:07,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:07,027 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2019-11-16 00:38:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:07,363 INFO L93 Difference]: Finished difference Result 577 states and 860 transitions. [2019-11-16 00:38:07,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:07,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-16 00:38:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:07,365 INFO L225 Difference]: With dead ends: 577 [2019-11-16 00:38:07,365 INFO L226 Difference]: Without dead ends: 313 [2019-11-16 00:38:07,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-16 00:38:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2019-11-16 00:38:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2019-11-16 00:38:07,373 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2019-11-16 00:38:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:07,374 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2019-11-16 00:38:07,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2019-11-16 00:38:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-16 00:38:07,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,375 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:07,375 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -344193252, now seen corresponding path program 1 times [2019-11-16 00:38:07,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143399746] [2019-11-16 00:38:07,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:07,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143399746] [2019-11-16 00:38:07,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:07,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988858923] [2019-11-16 00:38:07,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:07,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:07,465 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2019-11-16 00:38:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:07,766 INFO L93 Difference]: Finished difference Result 577 states and 858 transitions. [2019-11-16 00:38:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:07,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-16 00:38:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:07,768 INFO L225 Difference]: With dead ends: 577 [2019-11-16 00:38:07,769 INFO L226 Difference]: Without dead ends: 313 [2019-11-16 00:38:07,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-16 00:38:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2019-11-16 00:38:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2019-11-16 00:38:07,777 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 113 [2019-11-16 00:38:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:07,777 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2019-11-16 00:38:07,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2019-11-16 00:38:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-16 00:38:07,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,778 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:07,778 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash -574798082, now seen corresponding path program 1 times [2019-11-16 00:38:07,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048832472] [2019-11-16 00:38:07,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:07,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048832472] [2019-11-16 00:38:07,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:07,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086486425] [2019-11-16 00:38:07,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:07,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:07,860 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2019-11-16 00:38:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,257 INFO L93 Difference]: Finished difference Result 573 states and 851 transitions. [2019-11-16 00:38:08,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:08,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-16 00:38:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,259 INFO L225 Difference]: With dead ends: 573 [2019-11-16 00:38:08,259 INFO L226 Difference]: Without dead ends: 309 [2019-11-16 00:38:08,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-16 00:38:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-11-16 00:38:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2019-11-16 00:38:08,268 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 114 [2019-11-16 00:38:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,268 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2019-11-16 00:38:08,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2019-11-16 00:38:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-16 00:38:08,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,270 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,270 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash -53439120, now seen corresponding path program 1 times [2019-11-16 00:38:08,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809285870] [2019-11-16 00:38:08,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:08,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809285870] [2019-11-16 00:38:08,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:08,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98236727] [2019-11-16 00:38:08,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:08,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:08,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:08,334 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2019-11-16 00:38:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,602 INFO L93 Difference]: Finished difference Result 573 states and 849 transitions. [2019-11-16 00:38:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:08,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-16 00:38:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,604 INFO L225 Difference]: With dead ends: 573 [2019-11-16 00:38:08,604 INFO L226 Difference]: Without dead ends: 309 [2019-11-16 00:38:08,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-16 00:38:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-11-16 00:38:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2019-11-16 00:38:08,613 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2019-11-16 00:38:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,613 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2019-11-16 00:38:08,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2019-11-16 00:38:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-16 00:38:08,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,614 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,614 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash -235371218, now seen corresponding path program 1 times [2019-11-16 00:38:08,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139362243] [2019-11-16 00:38:08,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:08,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139362243] [2019-11-16 00:38:08,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:08,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777917075] [2019-11-16 00:38:08,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:08,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:08,689 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2019-11-16 00:38:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,981 INFO L93 Difference]: Finished difference Result 571 states and 845 transitions. [2019-11-16 00:38:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:08,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-16 00:38:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,984 INFO L225 Difference]: With dead ends: 571 [2019-11-16 00:38:08,984 INFO L226 Difference]: Without dead ends: 307 [2019-11-16 00:38:08,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-16 00:38:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-11-16 00:38:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2019-11-16 00:38:08,993 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 115 [2019-11-16 00:38:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,993 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2019-11-16 00:38:08,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2019-11-16 00:38:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:38:08,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,995 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,995 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash 16472555, now seen corresponding path program 1 times [2019-11-16 00:38:08,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196682322] [2019-11-16 00:38:08,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:09,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196682322] [2019-11-16 00:38:09,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:09,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44724900] [2019-11-16 00:38:09,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:09,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:09,072 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2019-11-16 00:38:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,352 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2019-11-16 00:38:09,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:09,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-16 00:38:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,354 INFO L225 Difference]: With dead ends: 571 [2019-11-16 00:38:09,354 INFO L226 Difference]: Without dead ends: 307 [2019-11-16 00:38:09,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-16 00:38:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-11-16 00:38:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2019-11-16 00:38:09,363 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 116 [2019-11-16 00:38:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,363 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2019-11-16 00:38:09,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2019-11-16 00:38:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:38:09,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,364 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,364 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash -349731447, now seen corresponding path program 1 times [2019-11-16 00:38:09,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896905917] [2019-11-16 00:38:09,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:09,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896905917] [2019-11-16 00:38:09,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:09,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955769970] [2019-11-16 00:38:09,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:09,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:09,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:09,444 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2019-11-16 00:38:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,807 INFO L93 Difference]: Finished difference Result 569 states and 839 transitions. [2019-11-16 00:38:09,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:09,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:38:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,809 INFO L225 Difference]: With dead ends: 569 [2019-11-16 00:38:09,810 INFO L226 Difference]: Without dead ends: 305 [2019-11-16 00:38:09,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-16 00:38:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-11-16 00:38:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-16 00:38:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2019-11-16 00:38:09,818 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 117 [2019-11-16 00:38:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,818 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2019-11-16 00:38:09,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2019-11-16 00:38:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:38:09,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,820 INFO L380 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] [2019-11-16 00:38:09,820 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 629494119, now seen corresponding path program 1 times [2019-11-16 00:38:09,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519996348] [2019-11-16 00:38:09,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:09,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519996348] [2019-11-16 00:38:09,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:09,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798464181] [2019-11-16 00:38:09,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:09,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:09,891 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2019-11-16 00:38:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,317 INFO L93 Difference]: Finished difference Result 618 states and 914 transitions. [2019-11-16 00:38:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:10,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:38:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,319 INFO L225 Difference]: With dead ends: 618 [2019-11-16 00:38:10,320 INFO L226 Difference]: Without dead ends: 354 [2019-11-16 00:38:10,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-16 00:38:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2019-11-16 00:38:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-16 00:38:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2019-11-16 00:38:10,331 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 117 [2019-11-16 00:38:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,332 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2019-11-16 00:38:10,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2019-11-16 00:38:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-16 00:38:10,333 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,333 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:10,334 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1118786538, now seen corresponding path program 1 times [2019-11-16 00:38:10,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114077583] [2019-11-16 00:38:10,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:10,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114077583] [2019-11-16 00:38:10,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:10,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924541457] [2019-11-16 00:38:10,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:10,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:10,424 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand 4 states. [2019-11-16 00:38:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,845 INFO L93 Difference]: Finished difference Result 717 states and 1082 transitions. [2019-11-16 00:38:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:10,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-16 00:38:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,847 INFO L225 Difference]: With dead ends: 717 [2019-11-16 00:38:10,847 INFO L226 Difference]: Without dead ends: 421 [2019-11-16 00:38:10,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-16 00:38:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 354. [2019-11-16 00:38:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-11-16 00:38:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 541 transitions. [2019-11-16 00:38:10,857 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 541 transitions. Word has length 118 [2019-11-16 00:38:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,858 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 541 transitions. [2019-11-16 00:38:10,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 541 transitions. [2019-11-16 00:38:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:38:10,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,859 INFO L380 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-11-16 00:38:10,859 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1992730650, now seen corresponding path program 1 times [2019-11-16 00:38:10,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935720195] [2019-11-16 00:38:10,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:10,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935720195] [2019-11-16 00:38:10,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:10,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695120120] [2019-11-16 00:38:10,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:10,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:10,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:10,984 INFO L87 Difference]: Start difference. First operand 354 states and 541 transitions. Second operand 4 states. [2019-11-16 00:38:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:11,439 INFO L93 Difference]: Finished difference Result 748 states and 1141 transitions. [2019-11-16 00:38:11,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:11,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-16 00:38:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:11,441 INFO L225 Difference]: With dead ends: 748 [2019-11-16 00:38:11,441 INFO L226 Difference]: Without dead ends: 413 [2019-11-16 00:38:11,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-16 00:38:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2019-11-16 00:38:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-16 00:38:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 540 transitions. [2019-11-16 00:38:11,451 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 540 transitions. Word has length 119 [2019-11-16 00:38:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:11,451 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 540 transitions. [2019-11-16 00:38:11,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 540 transitions. [2019-11-16 00:38:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:38:11,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:11,453 INFO L380 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] [2019-11-16 00:38:11,453 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash 375832611, now seen corresponding path program 1 times [2019-11-16 00:38:11,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:11,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514788717] [2019-11-16 00:38:11,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:11,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514788717] [2019-11-16 00:38:11,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:11,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:11,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540953080] [2019-11-16 00:38:11,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:11,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:11,516 INFO L87 Difference]: Start difference. First operand 353 states and 540 transitions. Second operand 4 states. [2019-11-16 00:38:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:11,859 INFO L93 Difference]: Finished difference Result 713 states and 1091 transitions. [2019-11-16 00:38:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:11,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-16 00:38:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:11,862 INFO L225 Difference]: With dead ends: 713 [2019-11-16 00:38:11,862 INFO L226 Difference]: Without dead ends: 379 [2019-11-16 00:38:11,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-16 00:38:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-11-16 00:38:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-16 00:38:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2019-11-16 00:38:11,872 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 119 [2019-11-16 00:38:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:11,872 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2019-11-16 00:38:11,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2019-11-16 00:38:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-16 00:38:11,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:11,873 INFO L380 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] [2019-11-16 00:38:11,874 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -239737582, now seen corresponding path program 1 times [2019-11-16 00:38:11,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:11,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963628845] [2019-11-16 00:38:11,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:11,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963628845] [2019-11-16 00:38:11,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:11,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:11,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812057811] [2019-11-16 00:38:11,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:11,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:11,965 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand 4 states. [2019-11-16 00:38:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,225 INFO L93 Difference]: Finished difference Result 713 states and 1089 transitions. [2019-11-16 00:38:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:12,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-16 00:38:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,227 INFO L225 Difference]: With dead ends: 713 [2019-11-16 00:38:12,227 INFO L226 Difference]: Without dead ends: 379 [2019-11-16 00:38:12,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-16 00:38:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-11-16 00:38:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-16 00:38:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 538 transitions. [2019-11-16 00:38:12,238 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 538 transitions. Word has length 120 [2019-11-16 00:38:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,238 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 538 transitions. [2019-11-16 00:38:12,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2019-11-16 00:38:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:38:12,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,239 INFO L380 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] [2019-11-16 00:38:12,240 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1589606562, now seen corresponding path program 1 times [2019-11-16 00:38:12,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127426543] [2019-11-16 00:38:12,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:12,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127426543] [2019-11-16 00:38:12,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:12,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129837838] [2019-11-16 00:38:12,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:12,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:12,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,310 INFO L87 Difference]: Start difference. First operand 353 states and 538 transitions. Second operand 4 states. [2019-11-16 00:38:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,616 INFO L93 Difference]: Finished difference Result 713 states and 1087 transitions. [2019-11-16 00:38:12,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:12,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-16 00:38:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,618 INFO L225 Difference]: With dead ends: 713 [2019-11-16 00:38:12,618 INFO L226 Difference]: Without dead ends: 379 [2019-11-16 00:38:12,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-16 00:38:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-11-16 00:38:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-16 00:38:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 537 transitions. [2019-11-16 00:38:12,629 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 537 transitions. Word has length 121 [2019-11-16 00:38:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,629 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 537 transitions. [2019-11-16 00:38:12,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 537 transitions. [2019-11-16 00:38:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-16 00:38:12,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,631 INFO L380 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] [2019-11-16 00:38:12,631 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash 67065837, now seen corresponding path program 1 times [2019-11-16 00:38:12,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651868463] [2019-11-16 00:38:12,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:12,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651868463] [2019-11-16 00:38:12,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:12,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983198583] [2019-11-16 00:38:12,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:12,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,692 INFO L87 Difference]: Start difference. First operand 353 states and 537 transitions. Second operand 4 states. [2019-11-16 00:38:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:13,027 INFO L93 Difference]: Finished difference Result 703 states and 1073 transitions. [2019-11-16 00:38:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:13,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-16 00:38:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:13,029 INFO L225 Difference]: With dead ends: 703 [2019-11-16 00:38:13,029 INFO L226 Difference]: Without dead ends: 369 [2019-11-16 00:38:13,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-16 00:38:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2019-11-16 00:38:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-16 00:38:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2019-11-16 00:38:13,040 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 122 [2019-11-16 00:38:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:13,040 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2019-11-16 00:38:13,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2019-11-16 00:38:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-16 00:38:13,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:13,042 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:13,042 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash -184111027, now seen corresponding path program 1 times [2019-11-16 00:38:13,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:13,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387884509] [2019-11-16 00:38:13,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:13,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387884509] [2019-11-16 00:38:13,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:13,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:13,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752434506] [2019-11-16 00:38:13,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:13,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:13,109 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand 4 states. [2019-11-16 00:38:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:13,637 INFO L93 Difference]: Finished difference Result 793 states and 1214 transitions. [2019-11-16 00:38:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:13,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-16 00:38:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:13,640 INFO L225 Difference]: With dead ends: 793 [2019-11-16 00:38:13,640 INFO L226 Difference]: Without dead ends: 459 [2019-11-16 00:38:13,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-16 00:38:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 392. [2019-11-16 00:38:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-16 00:38:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2019-11-16 00:38:13,651 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 123 [2019-11-16 00:38:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:13,652 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2019-11-16 00:38:13,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2019-11-16 00:38:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-16 00:38:13,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:13,653 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:13,654 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 902900419, now seen corresponding path program 1 times [2019-11-16 00:38:13,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:13,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552900862] [2019-11-16 00:38:13,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:13,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552900862] [2019-11-16 00:38:13,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:13,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:13,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854522711] [2019-11-16 00:38:13,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:13,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:13,716 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand 4 states. [2019-11-16 00:38:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,271 INFO L93 Difference]: Finished difference Result 824 states and 1273 transitions. [2019-11-16 00:38:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:14,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-16 00:38:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,274 INFO L225 Difference]: With dead ends: 824 [2019-11-16 00:38:14,274 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:38:14,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:38:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2019-11-16 00:38:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-16 00:38:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2019-11-16 00:38:14,285 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 124 [2019-11-16 00:38:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,286 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2019-11-16 00:38:14,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2019-11-16 00:38:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-16 00:38:14,287 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,287 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:14,287 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash 155929017, now seen corresponding path program 1 times [2019-11-16 00:38:14,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483012990] [2019-11-16 00:38:14,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:14,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483012990] [2019-11-16 00:38:14,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:14,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:14,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049663746] [2019-11-16 00:38:14,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:14,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:14,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:14,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:14,358 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand 4 states. [2019-11-16 00:38:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,735 INFO L93 Difference]: Finished difference Result 702 states and 1070 transitions. [2019-11-16 00:38:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:14,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-16 00:38:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,737 INFO L225 Difference]: With dead ends: 702 [2019-11-16 00:38:14,737 INFO L226 Difference]: Without dead ends: 368 [2019-11-16 00:38:14,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-16 00:38:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2019-11-16 00:38:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-16 00:38:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2019-11-16 00:38:14,748 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 125 [2019-11-16 00:38:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,749 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2019-11-16 00:38:14,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2019-11-16 00:38:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:38:14,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,750 INFO L380 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] [2019-11-16 00:38:14,750 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash 911219166, now seen corresponding path program 1 times [2019-11-16 00:38:14,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326376616] [2019-11-16 00:38:14,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:14,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326376616] [2019-11-16 00:38:14,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:14,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:14,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395277750] [2019-11-16 00:38:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:14,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:14,807 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand 4 states. [2019-11-16 00:38:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,242 INFO L93 Difference]: Finished difference Result 732 states and 1108 transitions. [2019-11-16 00:38:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:15,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-16 00:38:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,244 INFO L225 Difference]: With dead ends: 732 [2019-11-16 00:38:15,244 INFO L226 Difference]: Without dead ends: 395 [2019-11-16 00:38:15,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-16 00:38:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 356. [2019-11-16 00:38:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-16 00:38:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 538 transitions. [2019-11-16 00:38:15,264 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 538 transitions. Word has length 132 [2019-11-16 00:38:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,264 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 538 transitions. [2019-11-16 00:38:15,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2019-11-16 00:38:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:38:15,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,266 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:15,266 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1006654638, now seen corresponding path program 1 times [2019-11-16 00:38:15,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565722957] [2019-11-16 00:38:15,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:15,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565722957] [2019-11-16 00:38:15,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:15,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:15,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859927069] [2019-11-16 00:38:15,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:15,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:15,330 INFO L87 Difference]: Start difference. First operand 356 states and 538 transitions. Second operand 4 states. [2019-11-16 00:38:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,716 INFO L93 Difference]: Finished difference Result 755 states and 1150 transitions. [2019-11-16 00:38:15,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:15,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-16 00:38:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,718 INFO L225 Difference]: With dead ends: 755 [2019-11-16 00:38:15,718 INFO L226 Difference]: Without dead ends: 418 [2019-11-16 00:38:15,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-16 00:38:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2019-11-16 00:38:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:38:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 587 transitions. [2019-11-16 00:38:15,730 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 587 transitions. Word has length 132 [2019-11-16 00:38:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,730 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 587 transitions. [2019-11-16 00:38:15,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 587 transitions. [2019-11-16 00:38:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-16 00:38:15,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,732 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-11-16 00:38:15,732 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash -822623561, now seen corresponding path program 1 times [2019-11-16 00:38:15,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615424512] [2019-11-16 00:38:15,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:15,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615424512] [2019-11-16 00:38:15,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:15,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:15,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021216313] [2019-11-16 00:38:15,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:15,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:15,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:15,802 INFO L87 Difference]: Start difference. First operand 384 states and 587 transitions. Second operand 4 states. [2019-11-16 00:38:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,097 INFO L93 Difference]: Finished difference Result 788 states and 1204 transitions. [2019-11-16 00:38:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:16,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-16 00:38:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,100 INFO L225 Difference]: With dead ends: 788 [2019-11-16 00:38:16,100 INFO L226 Difference]: Without dead ends: 423 [2019-11-16 00:38:16,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-16 00:38:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 384. [2019-11-16 00:38:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:38:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2019-11-16 00:38:16,112 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 133 [2019-11-16 00:38:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2019-11-16 00:38:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2019-11-16 00:38:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-16 00:38:16,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,114 INFO L380 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] [2019-11-16 00:38:16,114 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash 702294863, now seen corresponding path program 1 times [2019-11-16 00:38:16,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886313664] [2019-11-16 00:38:16,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:16,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886313664] [2019-11-16 00:38:16,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:16,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863397199] [2019-11-16 00:38:16,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:16,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:16,177 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand 4 states. [2019-11-16 00:38:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,566 INFO L93 Difference]: Finished difference Result 847 states and 1301 transitions. [2019-11-16 00:38:16,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:16,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-16 00:38:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,586 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:38:16,586 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:16,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 396. [2019-11-16 00:38:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-16 00:38:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 603 transitions. [2019-11-16 00:38:16,599 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 603 transitions. Word has length 133 [2019-11-16 00:38:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,599 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 603 transitions. [2019-11-16 00:38:16,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 603 transitions. [2019-11-16 00:38:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:38:16,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,601 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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] [2019-11-16 00:38:16,601 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1815764569, now seen corresponding path program 1 times [2019-11-16 00:38:16,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105919460] [2019-11-16 00:38:16,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:16,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105919460] [2019-11-16 00:38:16,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:16,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068672210] [2019-11-16 00:38:16,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:16,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:16,663 INFO L87 Difference]: Start difference. First operand 396 states and 603 transitions. Second operand 4 states. [2019-11-16 00:38:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,073 INFO L93 Difference]: Finished difference Result 812 states and 1236 transitions. [2019-11-16 00:38:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:17,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-16 00:38:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,076 INFO L225 Difference]: With dead ends: 812 [2019-11-16 00:38:17,076 INFO L226 Difference]: Without dead ends: 435 [2019-11-16 00:38:17,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-16 00:38:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 396. [2019-11-16 00:38:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-16 00:38:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 602 transitions. [2019-11-16 00:38:17,089 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 602 transitions. Word has length 134 [2019-11-16 00:38:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,089 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 602 transitions. [2019-11-16 00:38:17,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 602 transitions. [2019-11-16 00:38:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:38:17,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,091 INFO L380 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] [2019-11-16 00:38:17,091 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1290657638, now seen corresponding path program 1 times [2019-11-16 00:38:17,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087290104] [2019-11-16 00:38:17,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:17,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087290104] [2019-11-16 00:38:17,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:17,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:17,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455114670] [2019-11-16 00:38:17,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:17,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:17,147 INFO L87 Difference]: Start difference. First operand 396 states and 602 transitions. Second operand 4 states. [2019-11-16 00:38:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,491 INFO L93 Difference]: Finished difference Result 859 states and 1315 transitions. [2019-11-16 00:38:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:17,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-16 00:38:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,493 INFO L225 Difference]: With dead ends: 859 [2019-11-16 00:38:17,494 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:17,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 397. [2019-11-16 00:38:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-16 00:38:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 603 transitions. [2019-11-16 00:38:17,504 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 603 transitions. Word has length 134 [2019-11-16 00:38:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,505 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 603 transitions. [2019-11-16 00:38:17,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 603 transitions. [2019-11-16 00:38:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-16 00:38:17,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,508 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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] [2019-11-16 00:38:17,508 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1740611502, now seen corresponding path program 1 times [2019-11-16 00:38:17,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64950471] [2019-11-16 00:38:17,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:17,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64950471] [2019-11-16 00:38:17,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:17,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:17,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237662684] [2019-11-16 00:38:17,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:17,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:17,580 INFO L87 Difference]: Start difference. First operand 397 states and 603 transitions. Second operand 4 states. [2019-11-16 00:38:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,951 INFO L93 Difference]: Finished difference Result 804 states and 1224 transitions. [2019-11-16 00:38:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:17,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-16 00:38:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,953 INFO L225 Difference]: With dead ends: 804 [2019-11-16 00:38:17,953 INFO L226 Difference]: Without dead ends: 426 [2019-11-16 00:38:17,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-16 00:38:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 397. [2019-11-16 00:38:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-16 00:38:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 602 transitions. [2019-11-16 00:38:17,963 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 602 transitions. Word has length 135 [2019-11-16 00:38:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,963 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 602 transitions. [2019-11-16 00:38:17,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 602 transitions. [2019-11-16 00:38:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-16 00:38:17,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,964 INFO L380 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] [2019-11-16 00:38:17,964 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1391994998, now seen corresponding path program 1 times [2019-11-16 00:38:17,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985056840] [2019-11-16 00:38:17,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:18,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985056840] [2019-11-16 00:38:18,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:18,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:18,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229774744] [2019-11-16 00:38:18,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:18,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:18,022 INFO L87 Difference]: Start difference. First operand 397 states and 602 transitions. Second operand 4 states. [2019-11-16 00:38:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,342 INFO L93 Difference]: Finished difference Result 860 states and 1313 transitions. [2019-11-16 00:38:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:18,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-16 00:38:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,344 INFO L225 Difference]: With dead ends: 860 [2019-11-16 00:38:18,344 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:18,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 398. [2019-11-16 00:38:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-16 00:38:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 603 transitions. [2019-11-16 00:38:18,354 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 603 transitions. Word has length 135 [2019-11-16 00:38:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,354 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 603 transitions. [2019-11-16 00:38:18,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 603 transitions. [2019-11-16 00:38:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-16 00:38:18,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,355 INFO L380 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] [2019-11-16 00:38:18,356 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1898057025, now seen corresponding path program 1 times [2019-11-16 00:38:18,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:18,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158274663] [2019-11-16 00:38:18,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:18,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158274663] [2019-11-16 00:38:18,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:18,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:18,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595839304] [2019-11-16 00:38:18,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:18,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:18,418 INFO L87 Difference]: Start difference. First operand 398 states and 603 transitions. Second operand 4 states. [2019-11-16 00:38:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,742 INFO L93 Difference]: Finished difference Result 851 states and 1301 transitions. [2019-11-16 00:38:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:18,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-16 00:38:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,744 INFO L225 Difference]: With dead ends: 851 [2019-11-16 00:38:18,744 INFO L226 Difference]: Without dead ends: 472 [2019-11-16 00:38:18,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-16 00:38:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 399. [2019-11-16 00:38:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-16 00:38:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 604 transitions. [2019-11-16 00:38:18,754 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 604 transitions. Word has length 136 [2019-11-16 00:38:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,754 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 604 transitions. [2019-11-16 00:38:18,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 604 transitions. [2019-11-16 00:38:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-16 00:38:18,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,755 INFO L380 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] [2019-11-16 00:38:18,756 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1925950920, now seen corresponding path program 1 times [2019-11-16 00:38:18,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:18,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002511692] [2019-11-16 00:38:18,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:18,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002511692] [2019-11-16 00:38:18,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:18,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:18,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756900848] [2019-11-16 00:38:18,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:18,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:18,815 INFO L87 Difference]: Start difference. First operand 399 states and 604 transitions. Second operand 4 states. [2019-11-16 00:38:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,158 INFO L93 Difference]: Finished difference Result 862 states and 1313 transitions. [2019-11-16 00:38:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:19,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-16 00:38:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,161 INFO L225 Difference]: With dead ends: 862 [2019-11-16 00:38:19,161 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:19,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-11-16 00:38:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-16 00:38:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2019-11-16 00:38:19,171 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 138 [2019-11-16 00:38:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,172 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2019-11-16 00:38:19,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2019-11-16 00:38:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-16 00:38:19,173 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:19,173 INFO L380 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] [2019-11-16 00:38:19,173 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1419416989, now seen corresponding path program 1 times [2019-11-16 00:38:19,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426637631] [2019-11-16 00:38:19,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:19,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426637631] [2019-11-16 00:38:19,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:19,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:19,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802993843] [2019-11-16 00:38:19,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:19,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:19,234 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand 4 states. [2019-11-16 00:38:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,593 INFO L93 Difference]: Finished difference Result 862 states and 1311 transitions. [2019-11-16 00:38:19,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:19,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-16 00:38:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,595 INFO L225 Difference]: With dead ends: 862 [2019-11-16 00:38:19,595 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:19,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-11-16 00:38:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-16 00:38:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 602 transitions. [2019-11-16 00:38:19,606 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 602 transitions. Word has length 139 [2019-11-16 00:38:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,606 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 602 transitions. [2019-11-16 00:38:19,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 602 transitions. [2019-11-16 00:38:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-16 00:38:19,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:19,607 INFO L380 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] [2019-11-16 00:38:19,607 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1695422413, now seen corresponding path program 1 times [2019-11-16 00:38:19,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248225817] [2019-11-16 00:38:19,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:19,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248225817] [2019-11-16 00:38:19,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:19,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:19,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245627190] [2019-11-16 00:38:19,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:19,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:19,666 INFO L87 Difference]: Start difference. First operand 399 states and 602 transitions. Second operand 4 states. [2019-11-16 00:38:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:20,037 INFO L93 Difference]: Finished difference Result 862 states and 1309 transitions. [2019-11-16 00:38:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:20,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-16 00:38:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:20,039 INFO L225 Difference]: With dead ends: 862 [2019-11-16 00:38:20,039 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:20,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-11-16 00:38:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-16 00:38:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 601 transitions. [2019-11-16 00:38:20,049 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 601 transitions. Word has length 140 [2019-11-16 00:38:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:20,049 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 601 transitions. [2019-11-16 00:38:20,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 601 transitions. [2019-11-16 00:38:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:38:20,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:20,050 INFO L380 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] [2019-11-16 00:38:20,050 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1081741752, now seen corresponding path program 1 times [2019-11-16 00:38:20,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:20,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683105615] [2019-11-16 00:38:20,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:20,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683105615] [2019-11-16 00:38:20,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:20,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:20,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568386278] [2019-11-16 00:38:20,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:20,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:20,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:20,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:20,107 INFO L87 Difference]: Start difference. First operand 399 states and 601 transitions. Second operand 4 states. [2019-11-16 00:38:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:20,425 INFO L93 Difference]: Finished difference Result 852 states and 1295 transitions. [2019-11-16 00:38:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:20,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-16 00:38:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:20,428 INFO L225 Difference]: With dead ends: 852 [2019-11-16 00:38:20,428 INFO L226 Difference]: Without dead ends: 472 [2019-11-16 00:38:20,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-16 00:38:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2019-11-16 00:38:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:38:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 580 transitions. [2019-11-16 00:38:20,438 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 580 transitions. Word has length 141 [2019-11-16 00:38:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:20,438 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 580 transitions. [2019-11-16 00:38:20,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 580 transitions. [2019-11-16 00:38:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-16 00:38:20,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:20,439 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 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-11-16 00:38:20,439 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1733954747, now seen corresponding path program 1 times [2019-11-16 00:38:20,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:20,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215882303] [2019-11-16 00:38:20,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:20,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215882303] [2019-11-16 00:38:20,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:20,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:20,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956254662] [2019-11-16 00:38:20,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:20,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:20,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:20,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:20,518 INFO L87 Difference]: Start difference. First operand 384 states and 580 transitions. Second operand 4 states. [2019-11-16 00:38:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:20,887 INFO L93 Difference]: Finished difference Result 778 states and 1178 transitions. [2019-11-16 00:38:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:20,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-16 00:38:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:20,892 INFO L225 Difference]: With dead ends: 778 [2019-11-16 00:38:20,892 INFO L226 Difference]: Without dead ends: 413 [2019-11-16 00:38:20,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-16 00:38:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 384. [2019-11-16 00:38:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:38:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 579 transitions. [2019-11-16 00:38:20,902 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 579 transitions. Word has length 142 [2019-11-16 00:38:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:20,902 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 579 transitions. [2019-11-16 00:38:20,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 579 transitions. [2019-11-16 00:38:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-16 00:38:20,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:20,903 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 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-11-16 00:38:20,903 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1487084510, now seen corresponding path program 1 times [2019-11-16 00:38:20,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:20,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663360011] [2019-11-16 00:38:20,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:20,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663360011] [2019-11-16 00:38:20,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:20,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:20,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688115570] [2019-11-16 00:38:20,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:20,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:20,971 INFO L87 Difference]: Start difference. First operand 384 states and 579 transitions. Second operand 4 states. [2019-11-16 00:38:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:21,284 INFO L93 Difference]: Finished difference Result 770 states and 1163 transitions. [2019-11-16 00:38:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:21,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-16 00:38:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:21,286 INFO L225 Difference]: With dead ends: 770 [2019-11-16 00:38:21,286 INFO L226 Difference]: Without dead ends: 405 [2019-11-16 00:38:21,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-11-16 00:38:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 384. [2019-11-16 00:38:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:38:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 578 transitions. [2019-11-16 00:38:21,296 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 578 transitions. Word has length 143 [2019-11-16 00:38:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:21,296 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 578 transitions. [2019-11-16 00:38:21,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 578 transitions. [2019-11-16 00:38:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-16 00:38:21,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:21,297 INFO L380 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] [2019-11-16 00:38:21,297 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1979951990, now seen corresponding path program 1 times [2019-11-16 00:38:21,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:21,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143590096] [2019-11-16 00:38:21,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:21,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143590096] [2019-11-16 00:38:21,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:21,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:21,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392248238] [2019-11-16 00:38:21,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:21,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:21,364 INFO L87 Difference]: Start difference. First operand 384 states and 578 transitions. Second operand 4 states. [2019-11-16 00:38:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:21,684 INFO L93 Difference]: Finished difference Result 837 states and 1269 transitions. [2019-11-16 00:38:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:21,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-16 00:38:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:21,687 INFO L225 Difference]: With dead ends: 837 [2019-11-16 00:38:21,687 INFO L226 Difference]: Without dead ends: 472 [2019-11-16 00:38:21,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-16 00:38:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412. [2019-11-16 00:38:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-16 00:38:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 623 transitions. [2019-11-16 00:38:21,701 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 623 transitions. Word has length 143 [2019-11-16 00:38:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:21,701 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 623 transitions. [2019-11-16 00:38:21,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 623 transitions. [2019-11-16 00:38:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-16 00:38:21,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:21,702 INFO L380 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] [2019-11-16 00:38:21,703 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash 654076365, now seen corresponding path program 1 times [2019-11-16 00:38:21,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:21,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100747782] [2019-11-16 00:38:21,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:21,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100747782] [2019-11-16 00:38:21,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:21,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:21,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561041065] [2019-11-16 00:38:21,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:21,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:21,767 INFO L87 Difference]: Start difference. First operand 412 states and 623 transitions. Second operand 4 states. [2019-11-16 00:38:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:22,067 INFO L93 Difference]: Finished difference Result 857 states and 1300 transitions. [2019-11-16 00:38:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:22,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-16 00:38:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:22,069 INFO L225 Difference]: With dead ends: 857 [2019-11-16 00:38:22,069 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:38:22,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:38:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2019-11-16 00:38:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-16 00:38:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 624 transitions. [2019-11-16 00:38:22,086 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 624 transitions. Word has length 144 [2019-11-16 00:38:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:22,086 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 624 transitions. [2019-11-16 00:38:22,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 624 transitions. [2019-11-16 00:38:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-16 00:38:22,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:22,088 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 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-11-16 00:38:22,088 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:22,088 INFO L82 PathProgramCache]: Analyzing trace with hash -789557187, now seen corresponding path program 1 times [2019-11-16 00:38:22,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:22,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812999288] [2019-11-16 00:38:22,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:22,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812999288] [2019-11-16 00:38:22,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:22,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:22,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557368189] [2019-11-16 00:38:22,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:22,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:22,152 INFO L87 Difference]: Start difference. First operand 413 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:22,420 INFO L93 Difference]: Finished difference Result 823 states and 1247 transitions. [2019-11-16 00:38:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:22,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-16 00:38:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:22,422 INFO L225 Difference]: With dead ends: 823 [2019-11-16 00:38:22,422 INFO L226 Difference]: Without dead ends: 429 [2019-11-16 00:38:22,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-16 00:38:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2019-11-16 00:38:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-16 00:38:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 623 transitions. [2019-11-16 00:38:22,436 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 623 transitions. Word has length 146 [2019-11-16 00:38:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:22,436 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 623 transitions. [2019-11-16 00:38:22,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 623 transitions. [2019-11-16 00:38:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:38:22,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:22,437 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 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-11-16 00:38:22,437 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -147785938, now seen corresponding path program 1 times [2019-11-16 00:38:22,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:22,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355785027] [2019-11-16 00:38:22,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:22,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355785027] [2019-11-16 00:38:22,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:22,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:22,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571467806] [2019-11-16 00:38:22,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:22,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:22,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:22,500 INFO L87 Difference]: Start difference. First operand 413 states and 623 transitions. Second operand 4 states. [2019-11-16 00:38:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:22,734 INFO L93 Difference]: Finished difference Result 821 states and 1243 transitions. [2019-11-16 00:38:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:22,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:38:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:22,735 INFO L225 Difference]: With dead ends: 821 [2019-11-16 00:38:22,735 INFO L226 Difference]: Without dead ends: 427 [2019-11-16 00:38:22,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-16 00:38:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 413. [2019-11-16 00:38:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-16 00:38:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 622 transitions. [2019-11-16 00:38:22,746 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 622 transitions. Word has length 147 [2019-11-16 00:38:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:22,746 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 622 transitions. [2019-11-16 00:38:22,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 622 transitions. [2019-11-16 00:38:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:38:22,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:22,747 INFO L380 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] [2019-11-16 00:38:22,747 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -614168594, now seen corresponding path program 1 times [2019-11-16 00:38:22,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:22,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507275821] [2019-11-16 00:38:22,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:22,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507275821] [2019-11-16 00:38:22,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:22,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:22,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360655188] [2019-11-16 00:38:22,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:22,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:22,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:22,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:22,813 INFO L87 Difference]: Start difference. First operand 413 states and 622 transitions. Second operand 4 states. [2019-11-16 00:38:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:23,164 INFO L93 Difference]: Finished difference Result 855 states and 1292 transitions. [2019-11-16 00:38:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:23,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:38:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:23,165 INFO L225 Difference]: With dead ends: 855 [2019-11-16 00:38:23,165 INFO L226 Difference]: Without dead ends: 461 [2019-11-16 00:38:23,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-16 00:38:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 416. [2019-11-16 00:38:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2019-11-16 00:38:23,180 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 147 [2019-11-16 00:38:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:23,180 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2019-11-16 00:38:23,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2019-11-16 00:38:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:38:23,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:23,182 INFO L380 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] [2019-11-16 00:38:23,182 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1065566135, now seen corresponding path program 1 times [2019-11-16 00:38:23,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:23,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550456782] [2019-11-16 00:38:23,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:23,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550456782] [2019-11-16 00:38:23,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:23,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:23,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221585262] [2019-11-16 00:38:23,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:23,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:23,247 INFO L87 Difference]: Start difference. First operand 416 states and 627 transitions. Second operand 4 states. [2019-11-16 00:38:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:23,591 INFO L93 Difference]: Finished difference Result 847 states and 1278 transitions. [2019-11-16 00:38:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:23,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:38:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:23,592 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:38:23,592 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:38:23,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:38:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-11-16 00:38:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 626 transitions. [2019-11-16 00:38:23,609 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 626 transitions. Word has length 147 [2019-11-16 00:38:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:23,609 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 626 transitions. [2019-11-16 00:38:23,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 626 transitions. [2019-11-16 00:38:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:38:23,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:23,611 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-11-16 00:38:23,611 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 34276127, now seen corresponding path program 1 times [2019-11-16 00:38:23,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:23,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693016906] [2019-11-16 00:38:23,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:23,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693016906] [2019-11-16 00:38:23,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:23,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:23,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274756433] [2019-11-16 00:38:23,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:23,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:23,678 INFO L87 Difference]: Start difference. First operand 416 states and 626 transitions. Second operand 4 states. [2019-11-16 00:38:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:24,068 INFO L93 Difference]: Finished difference Result 869 states and 1311 transitions. [2019-11-16 00:38:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:24,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-16 00:38:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:24,069 INFO L225 Difference]: With dead ends: 869 [2019-11-16 00:38:24,069 INFO L226 Difference]: Without dead ends: 472 [2019-11-16 00:38:24,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-16 00:38:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 416. [2019-11-16 00:38:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 625 transitions. [2019-11-16 00:38:24,092 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 625 transitions. Word has length 148 [2019-11-16 00:38:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:24,092 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 625 transitions. [2019-11-16 00:38:24,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 625 transitions. [2019-11-16 00:38:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:38:24,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:24,094 INFO L380 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] [2019-11-16 00:38:24,094 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -332834818, now seen corresponding path program 1 times [2019-11-16 00:38:24,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:24,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120371332] [2019-11-16 00:38:24,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:24,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120371332] [2019-11-16 00:38:24,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:24,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:24,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199661047] [2019-11-16 00:38:24,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:24,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:24,194 INFO L87 Difference]: Start difference. First operand 416 states and 625 transitions. Second operand 4 states. [2019-11-16 00:38:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:24,520 INFO L93 Difference]: Finished difference Result 847 states and 1274 transitions. [2019-11-16 00:38:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:24,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-16 00:38:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:24,522 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:38:24,522 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:38:24,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:38:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-11-16 00:38:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 624 transitions. [2019-11-16 00:38:24,538 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 624 transitions. Word has length 148 [2019-11-16 00:38:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:24,538 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 624 transitions. [2019-11-16 00:38:24,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 624 transitions. [2019-11-16 00:38:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:38:24,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:24,540 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-11-16 00:38:24,540 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 467666756, now seen corresponding path program 1 times [2019-11-16 00:38:24,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:24,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023477054] [2019-11-16 00:38:24,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:24,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023477054] [2019-11-16 00:38:24,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:24,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:24,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743564641] [2019-11-16 00:38:24,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:24,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:24,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:24,600 INFO L87 Difference]: Start difference. First operand 416 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:24,899 INFO L93 Difference]: Finished difference Result 861 states and 1294 transitions. [2019-11-16 00:38:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:24,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-16 00:38:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:24,900 INFO L225 Difference]: With dead ends: 861 [2019-11-16 00:38:24,900 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:38:24,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:38:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 416. [2019-11-16 00:38:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 623 transitions. [2019-11-16 00:38:24,917 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 623 transitions. Word has length 149 [2019-11-16 00:38:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:24,918 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 623 transitions. [2019-11-16 00:38:24,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 623 transitions. [2019-11-16 00:38:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:38:24,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:24,919 INFO L380 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] [2019-11-16 00:38:24,919 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:24,920 INFO L82 PathProgramCache]: Analyzing trace with hash -456214673, now seen corresponding path program 1 times [2019-11-16 00:38:24,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:24,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79365012] [2019-11-16 00:38:24,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:24,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79365012] [2019-11-16 00:38:24,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:24,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:24,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107336141] [2019-11-16 00:38:24,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:24,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:24,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:24,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:24,985 INFO L87 Difference]: Start difference. First operand 416 states and 623 transitions. Second operand 4 states. [2019-11-16 00:38:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:25,284 INFO L93 Difference]: Finished difference Result 858 states and 1288 transitions. [2019-11-16 00:38:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:25,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-16 00:38:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:25,285 INFO L225 Difference]: With dead ends: 858 [2019-11-16 00:38:25,285 INFO L226 Difference]: Without dead ends: 461 [2019-11-16 00:38:25,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-16 00:38:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 417. [2019-11-16 00:38:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-16 00:38:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 624 transitions. [2019-11-16 00:38:25,301 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 624 transitions. Word has length 149 [2019-11-16 00:38:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:25,301 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 624 transitions. [2019-11-16 00:38:25,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 624 transitions. [2019-11-16 00:38:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:38:25,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:25,302 INFO L380 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] [2019-11-16 00:38:25,302 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -180653582, now seen corresponding path program 1 times [2019-11-16 00:38:25,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:25,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309871289] [2019-11-16 00:38:25,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:25,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309871289] [2019-11-16 00:38:25,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:25,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:25,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274233876] [2019-11-16 00:38:25,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:25,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:25,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:25,359 INFO L87 Difference]: Start difference. First operand 417 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:25,680 INFO L93 Difference]: Finished difference Result 849 states and 1272 transitions. [2019-11-16 00:38:25,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:25,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-16 00:38:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:25,681 INFO L225 Difference]: With dead ends: 849 [2019-11-16 00:38:25,681 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:38:25,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:38:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2019-11-16 00:38:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-16 00:38:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 623 transitions. [2019-11-16 00:38:25,694 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 623 transitions. Word has length 149 [2019-11-16 00:38:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:25,694 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 623 transitions. [2019-11-16 00:38:25,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 623 transitions. [2019-11-16 00:38:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:38:25,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:25,695 INFO L380 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] [2019-11-16 00:38:25,695 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash 247505163, now seen corresponding path program 1 times [2019-11-16 00:38:25,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:25,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293665212] [2019-11-16 00:38:25,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:25,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293665212] [2019-11-16 00:38:25,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:25,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:25,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933163566] [2019-11-16 00:38:25,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:25,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:25,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:25,754 INFO L87 Difference]: Start difference. First operand 417 states and 623 transitions. Second operand 4 states. [2019-11-16 00:38:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:26,025 INFO L93 Difference]: Finished difference Result 855 states and 1281 transitions. [2019-11-16 00:38:26,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:26,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-16 00:38:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:26,026 INFO L225 Difference]: With dead ends: 855 [2019-11-16 00:38:26,026 INFO L226 Difference]: Without dead ends: 457 [2019-11-16 00:38:26,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-16 00:38:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 418. [2019-11-16 00:38:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-16 00:38:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 624 transitions. [2019-11-16 00:38:26,039 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 624 transitions. Word has length 150 [2019-11-16 00:38:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:26,039 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 624 transitions. [2019-11-16 00:38:26,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 624 transitions. [2019-11-16 00:38:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:38:26,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:26,040 INFO L380 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] [2019-11-16 00:38:26,040 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:26,040 INFO L82 PathProgramCache]: Analyzing trace with hash 768864125, now seen corresponding path program 1 times [2019-11-16 00:38:26,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:26,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799369570] [2019-11-16 00:38:26,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:26,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799369570] [2019-11-16 00:38:26,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:26,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:26,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700079659] [2019-11-16 00:38:26,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:26,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:26,110 INFO L87 Difference]: Start difference. First operand 418 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:26,385 INFO L93 Difference]: Finished difference Result 856 states and 1281 transitions. [2019-11-16 00:38:26,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:26,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-16 00:38:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:26,387 INFO L225 Difference]: With dead ends: 856 [2019-11-16 00:38:26,387 INFO L226 Difference]: Without dead ends: 457 [2019-11-16 00:38:26,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-16 00:38:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 419. [2019-11-16 00:38:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-16 00:38:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 625 transitions. [2019-11-16 00:38:26,404 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 625 transitions. Word has length 150 [2019-11-16 00:38:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:26,404 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 625 transitions. [2019-11-16 00:38:26,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2019-11-16 00:38:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:38:26,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:26,406 INFO L380 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] [2019-11-16 00:38:26,406 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash 794935257, now seen corresponding path program 1 times [2019-11-16 00:38:26,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:26,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389953342] [2019-11-16 00:38:26,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:26,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389953342] [2019-11-16 00:38:26,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:26,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:26,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213067137] [2019-11-16 00:38:26,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:26,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:26,476 INFO L87 Difference]: Start difference. First operand 419 states and 625 transitions. Second operand 4 states. [2019-11-16 00:38:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:26,753 INFO L93 Difference]: Finished difference Result 843 states and 1262 transitions. [2019-11-16 00:38:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:26,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-16 00:38:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:26,754 INFO L225 Difference]: With dead ends: 843 [2019-11-16 00:38:26,754 INFO L226 Difference]: Without dead ends: 443 [2019-11-16 00:38:26,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-16 00:38:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2019-11-16 00:38:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-16 00:38:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 624 transitions. [2019-11-16 00:38:26,768 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 624 transitions. Word has length 150 [2019-11-16 00:38:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:26,768 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 624 transitions. [2019-11-16 00:38:26,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 624 transitions. [2019-11-16 00:38:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-16 00:38:26,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:26,769 INFO L380 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] [2019-11-16 00:38:26,769 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -513774399, now seen corresponding path program 1 times [2019-11-16 00:38:26,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:26,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348295843] [2019-11-16 00:38:26,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:26,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348295843] [2019-11-16 00:38:26,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:26,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:26,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149666073] [2019-11-16 00:38:26,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:26,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:26,830 INFO L87 Difference]: Start difference. First operand 419 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:27,113 INFO L93 Difference]: Finished difference Result 855 states and 1277 transitions. [2019-11-16 00:38:27,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:27,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-16 00:38:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:27,114 INFO L225 Difference]: With dead ends: 855 [2019-11-16 00:38:27,114 INFO L226 Difference]: Without dead ends: 455 [2019-11-16 00:38:27,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-16 00:38:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 420. [2019-11-16 00:38:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-16 00:38:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 625 transitions. [2019-11-16 00:38:27,155 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 625 transitions. Word has length 151 [2019-11-16 00:38:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:27,156 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 625 transitions. [2019-11-16 00:38:27,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 625 transitions. [2019-11-16 00:38:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:38:27,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:27,157 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:27,157 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash -550116585, now seen corresponding path program 1 times [2019-11-16 00:38:27,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:27,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167872573] [2019-11-16 00:38:27,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:27,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:27,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:27,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167872573] [2019-11-16 00:38:27,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:27,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:27,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375025190] [2019-11-16 00:38:27,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:27,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:27,236 INFO L87 Difference]: Start difference. First operand 420 states and 625 transitions. Second operand 4 states. [2019-11-16 00:38:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:27,650 INFO L93 Difference]: Finished difference Result 862 states and 1284 transitions. [2019-11-16 00:38:27,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:27,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-16 00:38:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:27,651 INFO L225 Difference]: With dead ends: 862 [2019-11-16 00:38:27,651 INFO L226 Difference]: Without dead ends: 461 [2019-11-16 00:38:27,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-16 00:38:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 420. [2019-11-16 00:38:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-16 00:38:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 624 transitions. [2019-11-16 00:38:27,666 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 624 transitions. Word has length 152 [2019-11-16 00:38:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:27,666 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 624 transitions. [2019-11-16 00:38:27,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 624 transitions. [2019-11-16 00:38:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:38:27,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:27,667 INFO L380 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] [2019-11-16 00:38:27,667 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash -24091464, now seen corresponding path program 1 times [2019-11-16 00:38:27,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:27,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007248565] [2019-11-16 00:38:27,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:27,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:27,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:27,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007248565] [2019-11-16 00:38:27,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:27,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:27,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699228828] [2019-11-16 00:38:27,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:27,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:27,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:27,718 INFO L87 Difference]: Start difference. First operand 420 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:27,999 INFO L93 Difference]: Finished difference Result 856 states and 1275 transitions. [2019-11-16 00:38:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:27,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-16 00:38:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:28,000 INFO L225 Difference]: With dead ends: 856 [2019-11-16 00:38:28,000 INFO L226 Difference]: Without dead ends: 455 [2019-11-16 00:38:28,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-16 00:38:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 421. [2019-11-16 00:38:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-16 00:38:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 625 transitions. [2019-11-16 00:38:28,014 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 625 transitions. Word has length 152 [2019-11-16 00:38:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,014 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 625 transitions. [2019-11-16 00:38:28,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 625 transitions. [2019-11-16 00:38:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-16 00:38:28,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,015 INFO L380 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] [2019-11-16 00:38:28,015 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1607216036, now seen corresponding path program 1 times [2019-11-16 00:38:28,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:28,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530869247] [2019-11-16 00:38:28,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:28,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530869247] [2019-11-16 00:38:28,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:28,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:28,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74855670] [2019-11-16 00:38:28,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:28,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:28,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:28,076 INFO L87 Difference]: Start difference. First operand 421 states and 625 transitions. Second operand 4 states. [2019-11-16 00:38:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:28,379 INFO L93 Difference]: Finished difference Result 855 states and 1273 transitions. [2019-11-16 00:38:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:28,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-16 00:38:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:28,380 INFO L225 Difference]: With dead ends: 855 [2019-11-16 00:38:28,380 INFO L226 Difference]: Without dead ends: 453 [2019-11-16 00:38:28,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-16 00:38:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-11-16 00:38:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-16 00:38:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 626 transitions. [2019-11-16 00:38:28,400 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 626 transitions. Word has length 153 [2019-11-16 00:38:28,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,401 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 626 transitions. [2019-11-16 00:38:28,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 626 transitions. [2019-11-16 00:38:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-16 00:38:28,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,402 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-16 00:38:28,402 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash 968223832, now seen corresponding path program 1 times [2019-11-16 00:38:28,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:28,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443377774] [2019-11-16 00:38:28,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:28,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443377774] [2019-11-16 00:38:28,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:28,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:28,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877822368] [2019-11-16 00:38:28,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:28,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:28,458 INFO L87 Difference]: Start difference. First operand 422 states and 626 transitions. Second operand 4 states. [2019-11-16 00:38:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:28,751 INFO L93 Difference]: Finished difference Result 864 states and 1282 transitions. [2019-11-16 00:38:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:28,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-16 00:38:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:28,752 INFO L225 Difference]: With dead ends: 864 [2019-11-16 00:38:28,752 INFO L226 Difference]: Without dead ends: 461 [2019-11-16 00:38:28,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-16 00:38:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 422. [2019-11-16 00:38:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-16 00:38:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 625 transitions. [2019-11-16 00:38:28,766 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 625 transitions. Word has length 154 [2019-11-16 00:38:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,767 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 625 transitions. [2019-11-16 00:38:28,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2019-11-16 00:38:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:38:28,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,768 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-16 00:38:28,768 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:28,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1455425858, now seen corresponding path program 1 times [2019-11-16 00:38:28,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:28,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476441099] [2019-11-16 00:38:28,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:28,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476441099] [2019-11-16 00:38:28,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:28,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:28,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397207167] [2019-11-16 00:38:28,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:28,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:28,835 INFO L87 Difference]: Start difference. First operand 422 states and 625 transitions. Second operand 4 states. [2019-11-16 00:38:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,184 INFO L93 Difference]: Finished difference Result 860 states and 1275 transitions. [2019-11-16 00:38:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:29,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-16 00:38:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,185 INFO L225 Difference]: With dead ends: 860 [2019-11-16 00:38:29,185 INFO L226 Difference]: Without dead ends: 457 [2019-11-16 00:38:29,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-16 00:38:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2019-11-16 00:38:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-16 00:38:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 624 transitions. [2019-11-16 00:38:29,200 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 624 transitions. Word has length 155 [2019-11-16 00:38:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:29,200 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 624 transitions. [2019-11-16 00:38:29,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 624 transitions. [2019-11-16 00:38:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:38:29,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:29,201 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:29,202 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1976784820, now seen corresponding path program 1 times [2019-11-16 00:38:29,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:29,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620618045] [2019-11-16 00:38:29,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:29,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620618045] [2019-11-16 00:38:29,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:29,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:29,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104031464] [2019-11-16 00:38:29,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:29,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:29,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:29,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:29,271 INFO L87 Difference]: Start difference. First operand 422 states and 624 transitions. Second operand 4 states. [2019-11-16 00:38:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,573 INFO L93 Difference]: Finished difference Result 860 states and 1273 transitions. [2019-11-16 00:38:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:29,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-16 00:38:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,575 INFO L225 Difference]: With dead ends: 860 [2019-11-16 00:38:29,575 INFO L226 Difference]: Without dead ends: 457 [2019-11-16 00:38:29,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-16 00:38:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2019-11-16 00:38:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-16 00:38:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 623 transitions. [2019-11-16 00:38:29,597 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 623 transitions. Word has length 155 [2019-11-16 00:38:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:29,598 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 623 transitions. [2019-11-16 00:38:29,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 623 transitions. [2019-11-16 00:38:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:38:29,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:29,599 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:29,600 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1722938518, now seen corresponding path program 1 times [2019-11-16 00:38:29,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:29,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024997823] [2019-11-16 00:38:29,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:29,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024997823] [2019-11-16 00:38:29,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:29,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:29,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480381161] [2019-11-16 00:38:29,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:29,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:29,672 INFO L87 Difference]: Start difference. First operand 422 states and 623 transitions. Second operand 4 states. [2019-11-16 00:38:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,991 INFO L93 Difference]: Finished difference Result 858 states and 1269 transitions. [2019-11-16 00:38:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:29,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-16 00:38:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,992 INFO L225 Difference]: With dead ends: 858 [2019-11-16 00:38:29,992 INFO L226 Difference]: Without dead ends: 455 [2019-11-16 00:38:29,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-16 00:38:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2019-11-16 00:38:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-16 00:38:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 622 transitions. [2019-11-16 00:38:30,007 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 622 transitions. Word has length 156 [2019-11-16 00:38:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:30,007 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 622 transitions. [2019-11-16 00:38:30,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2019-11-16 00:38:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:38:30,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:30,008 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:30,008 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1146526511, now seen corresponding path program 1 times [2019-11-16 00:38:30,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:30,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947068896] [2019-11-16 00:38:30,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:30,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947068896] [2019-11-16 00:38:30,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:30,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:30,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295728796] [2019-11-16 00:38:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:30,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:30,066 INFO L87 Difference]: Start difference. First operand 422 states and 622 transitions. Second operand 4 states. [2019-11-16 00:38:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:30,381 INFO L93 Difference]: Finished difference Result 858 states and 1267 transitions. [2019-11-16 00:38:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:30,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-16 00:38:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:30,382 INFO L225 Difference]: With dead ends: 858 [2019-11-16 00:38:30,382 INFO L226 Difference]: Without dead ends: 455 [2019-11-16 00:38:30,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-16 00:38:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2019-11-16 00:38:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-16 00:38:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 621 transitions. [2019-11-16 00:38:30,400 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 621 transitions. Word has length 157 [2019-11-16 00:38:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:30,401 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 621 transitions. [2019-11-16 00:38:30,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 621 transitions. [2019-11-16 00:38:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:38:30,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:30,402 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:30,403 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1103781342, now seen corresponding path program 1 times [2019-11-16 00:38:30,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:30,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139044651] [2019-11-16 00:38:30,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:30,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139044651] [2019-11-16 00:38:30,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:30,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:30,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941976325] [2019-11-16 00:38:30,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:30,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:30,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:30,521 INFO L87 Difference]: Start difference. First operand 422 states and 621 transitions. Second operand 4 states. [2019-11-16 00:38:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:30,811 INFO L93 Difference]: Finished difference Result 891 states and 1322 transitions. [2019-11-16 00:38:30,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:30,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-16 00:38:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:30,812 INFO L225 Difference]: With dead ends: 891 [2019-11-16 00:38:30,812 INFO L226 Difference]: Without dead ends: 488 [2019-11-16 00:38:30,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-16 00:38:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2019-11-16 00:38:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-16 00:38:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 674 transitions. [2019-11-16 00:38:30,836 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 674 transitions. Word has length 157 [2019-11-16 00:38:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:30,836 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 674 transitions. [2019-11-16 00:38:30,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 674 transitions. [2019-11-16 00:38:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-16 00:38:30,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:30,838 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:30,838 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:30,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash 322202821, now seen corresponding path program 1 times [2019-11-16 00:38:30,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:30,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643478766] [2019-11-16 00:38:30,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:30,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643478766] [2019-11-16 00:38:30,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:30,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:30,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710074298] [2019-11-16 00:38:30,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:30,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:30,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:30,916 INFO L87 Difference]: Start difference. First operand 452 states and 674 transitions. Second operand 4 states. [2019-11-16 00:38:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:31,242 INFO L93 Difference]: Finished difference Result 916 states and 1369 transitions. [2019-11-16 00:38:31,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:31,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-16 00:38:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:31,243 INFO L225 Difference]: With dead ends: 916 [2019-11-16 00:38:31,243 INFO L226 Difference]: Without dead ends: 483 [2019-11-16 00:38:31,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-16 00:38:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 414. [2019-11-16 00:38:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-16 00:38:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 616 transitions. [2019-11-16 00:38:31,268 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 616 transitions. Word has length 158 [2019-11-16 00:38:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:31,268 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 616 transitions. [2019-11-16 00:38:31,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 616 transitions. [2019-11-16 00:38:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:38:31,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:31,269 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1] [2019-11-16 00:38:31,270 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:31,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash -27440751, now seen corresponding path program 1 times [2019-11-16 00:38:31,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:31,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536890542] [2019-11-16 00:38:31,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:31,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:31,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:31,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536890542] [2019-11-16 00:38:31,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:31,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:31,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017613186] [2019-11-16 00:38:31,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:31,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:31,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:31,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:31,331 INFO L87 Difference]: Start difference. First operand 414 states and 616 transitions. Second operand 4 states. [2019-11-16 00:38:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:31,763 INFO L93 Difference]: Finished difference Result 878 states and 1310 transitions. [2019-11-16 00:38:31,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:31,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-16 00:38:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:31,764 INFO L225 Difference]: With dead ends: 878 [2019-11-16 00:38:31,765 INFO L226 Difference]: Without dead ends: 483 [2019-11-16 00:38:31,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-16 00:38:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 430. [2019-11-16 00:38:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-11-16 00:38:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 637 transitions. [2019-11-16 00:38:31,789 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 637 transitions. Word has length 160 [2019-11-16 00:38:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:31,789 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 637 transitions. [2019-11-16 00:38:31,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 637 transitions. [2019-11-16 00:38:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-16 00:38:31,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:31,790 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1] [2019-11-16 00:38:31,791 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2002987098, now seen corresponding path program 1 times [2019-11-16 00:38:31,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:31,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871332979] [2019-11-16 00:38:31,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:31,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:31,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:31,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871332979] [2019-11-16 00:38:31,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:31,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:31,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727908561] [2019-11-16 00:38:31,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:31,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:31,848 INFO L87 Difference]: Start difference. First operand 430 states and 637 transitions. Second operand 4 states. [2019-11-16 00:38:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:32,218 INFO L93 Difference]: Finished difference Result 892 states and 1328 transitions. [2019-11-16 00:38:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:32,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-16 00:38:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:32,219 INFO L225 Difference]: With dead ends: 892 [2019-11-16 00:38:32,220 INFO L226 Difference]: Without dead ends: 481 [2019-11-16 00:38:32,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-16 00:38:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 431. [2019-11-16 00:38:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-16 00:38:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 638 transitions. [2019-11-16 00:38:32,243 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 638 transitions. Word has length 161 [2019-11-16 00:38:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:32,243 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 638 transitions. [2019-11-16 00:38:32,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 638 transitions. [2019-11-16 00:38:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-16 00:38:32,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:32,244 INFO L380 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] [2019-11-16 00:38:32,245 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 9508236, now seen corresponding path program 1 times [2019-11-16 00:38:32,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:32,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959819245] [2019-11-16 00:38:32,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:32,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:32,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-16 00:38:32,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959819245] [2019-11-16 00:38:32,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:32,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:32,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105253273] [2019-11-16 00:38:32,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:32,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:32,305 INFO L87 Difference]: Start difference. First operand 431 states and 638 transitions. Second operand 3 states. [2019-11-16 00:38:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:32,401 INFO L93 Difference]: Finished difference Result 1251 states and 1865 transitions. [2019-11-16 00:38:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:32,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-16 00:38:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:32,403 INFO L225 Difference]: With dead ends: 1251 [2019-11-16 00:38:32,403 INFO L226 Difference]: Without dead ends: 839 [2019-11-16 00:38:32,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-16 00:38:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2019-11-16 00:38:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-16 00:38:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1238 transitions. [2019-11-16 00:38:32,451 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1238 transitions. Word has length 161 [2019-11-16 00:38:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:32,451 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1238 transitions. [2019-11-16 00:38:32,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1238 transitions. [2019-11-16 00:38:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-16 00:38:32,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:32,453 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:32,453 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash -712421640, now seen corresponding path program 1 times [2019-11-16 00:38:32,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:32,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443082163] [2019-11-16 00:38:32,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:32,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:32,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:32,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443082163] [2019-11-16 00:38:32,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:32,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:32,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595961315] [2019-11-16 00:38:32,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:32,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:32,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:32,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:32,627 INFO L87 Difference]: Start difference. First operand 837 states and 1238 transitions. Second operand 5 states. [2019-11-16 00:38:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:33,140 INFO L93 Difference]: Finished difference Result 1807 states and 2688 transitions. [2019-11-16 00:38:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:38:33,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-16 00:38:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:33,141 INFO L225 Difference]: With dead ends: 1807 [2019-11-16 00:38:33,141 INFO L226 Difference]: Without dead ends: 989 [2019-11-16 00:38:33,142 INFO L600 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-11-16 00:38:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-16 00:38:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 903. [2019-11-16 00:38:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-16 00:38:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1356 transitions. [2019-11-16 00:38:33,173 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1356 transitions. Word has length 162 [2019-11-16 00:38:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:33,173 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1356 transitions. [2019-11-16 00:38:33,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1356 transitions. [2019-11-16 00:38:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:38:33,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:33,175 INFO L380 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-11-16 00:38:33,175 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:33,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1482730618, now seen corresponding path program 1 times [2019-11-16 00:38:33,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:33,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927485275] [2019-11-16 00:38:33,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:33,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:33,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:33,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927485275] [2019-11-16 00:38:33,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:33,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:33,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412493253] [2019-11-16 00:38:33,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:33,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:33,233 INFO L87 Difference]: Start difference. First operand 903 states and 1356 transitions. Second operand 4 states. [2019-11-16 00:38:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:33,554 INFO L93 Difference]: Finished difference Result 1887 states and 2834 transitions. [2019-11-16 00:38:33,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:33,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-16 00:38:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:33,555 INFO L225 Difference]: With dead ends: 1887 [2019-11-16 00:38:33,555 INFO L226 Difference]: Without dead ends: 1003 [2019-11-16 00:38:33,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-16 00:38:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 955. [2019-11-16 00:38:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-11-16 00:38:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1436 transitions. [2019-11-16 00:38:33,587 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1436 transitions. Word has length 164 [2019-11-16 00:38:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:33,587 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 1436 transitions. [2019-11-16 00:38:33,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1436 transitions. [2019-11-16 00:38:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:38:33,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:33,589 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2019-11-16 00:38:33,589 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2036144392, now seen corresponding path program 1 times [2019-11-16 00:38:33,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:33,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246654116] [2019-11-16 00:38:33,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:33,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:33,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:33,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246654116] [2019-11-16 00:38:33,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:33,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:33,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245914256] [2019-11-16 00:38:33,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:33,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:33,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:33,651 INFO L87 Difference]: Start difference. First operand 955 states and 1436 transitions. Second operand 4 states. [2019-11-16 00:38:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:34,156 INFO L93 Difference]: Finished difference Result 1949 states and 2928 transitions. [2019-11-16 00:38:34,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:34,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-16 00:38:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:34,157 INFO L225 Difference]: With dead ends: 1949 [2019-11-16 00:38:34,157 INFO L226 Difference]: Without dead ends: 1013 [2019-11-16 00:38:34,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-11-16 00:38:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 955. [2019-11-16 00:38:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-11-16 00:38:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1434 transitions. [2019-11-16 00:38:34,188 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1434 transitions. Word has length 165 [2019-11-16 00:38:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:34,189 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 1434 transitions. [2019-11-16 00:38:34,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1434 transitions. [2019-11-16 00:38:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:38:34,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:34,190 INFO L380 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-11-16 00:38:34,190 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 156450878, now seen corresponding path program 1 times [2019-11-16 00:38:34,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:34,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794961777] [2019-11-16 00:38:34,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:34,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:34,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:34,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794961777] [2019-11-16 00:38:34,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:34,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:34,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042558226] [2019-11-16 00:38:34,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:34,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:34,264 INFO L87 Difference]: Start difference. First operand 955 states and 1434 transitions. Second operand 4 states. [2019-11-16 00:38:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:34,730 INFO L93 Difference]: Finished difference Result 1927 states and 2892 transitions. [2019-11-16 00:38:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:34,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-16 00:38:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:34,732 INFO L225 Difference]: With dead ends: 1927 [2019-11-16 00:38:34,732 INFO L226 Difference]: Without dead ends: 987 [2019-11-16 00:38:34,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-16 00:38:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 953. [2019-11-16 00:38:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-16 00:38:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1430 transitions. [2019-11-16 00:38:34,781 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1430 transitions. Word has length 165 [2019-11-16 00:38:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:34,782 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1430 transitions. [2019-11-16 00:38:34,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1430 transitions. [2019-11-16 00:38:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:38:34,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:34,784 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2019-11-16 00:38:34,784 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1549617091, now seen corresponding path program 1 times [2019-11-16 00:38:34,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:34,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825598913] [2019-11-16 00:38:34,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:34,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:34,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:34,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825598913] [2019-11-16 00:38:34,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:34,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:34,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506195173] [2019-11-16 00:38:34,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:34,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:34,848 INFO L87 Difference]: Start difference. First operand 953 states and 1430 transitions. Second operand 4 states. [2019-11-16 00:38:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:35,180 INFO L93 Difference]: Finished difference Result 1941 states and 2912 transitions. [2019-11-16 00:38:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:35,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-16 00:38:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:35,181 INFO L225 Difference]: With dead ends: 1941 [2019-11-16 00:38:35,181 INFO L226 Difference]: Without dead ends: 1007 [2019-11-16 00:38:35,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-16 00:38:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 953. [2019-11-16 00:38:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-16 00:38:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1428 transitions. [2019-11-16 00:38:35,213 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1428 transitions. Word has length 166 [2019-11-16 00:38:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:35,213 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1428 transitions. [2019-11-16 00:38:35,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1428 transitions. [2019-11-16 00:38:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:38:35,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:35,214 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:35,214 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash -443861771, now seen corresponding path program 1 times [2019-11-16 00:38:35,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:35,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97924801] [2019-11-16 00:38:35,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:35,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:35,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:38:35,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97924801] [2019-11-16 00:38:35,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:35,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:35,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417250412] [2019-11-16 00:38:35,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:35,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:35,269 INFO L87 Difference]: Start difference. First operand 953 states and 1428 transitions. Second operand 3 states. [2019-11-16 00:38:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:35,370 INFO L93 Difference]: Finished difference Result 2349 states and 3535 transitions. [2019-11-16 00:38:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:35,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:38:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:35,372 INFO L225 Difference]: With dead ends: 2349 [2019-11-16 00:38:35,372 INFO L226 Difference]: Without dead ends: 1415 [2019-11-16 00:38:35,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-11-16 00:38:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1415. [2019-11-16 00:38:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-11-16 00:38:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2118 transitions. [2019-11-16 00:38:35,443 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2118 transitions. Word has length 166 [2019-11-16 00:38:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:35,444 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 2118 transitions. [2019-11-16 00:38:35,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2118 transitions. [2019-11-16 00:38:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-16 00:38:35,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:35,446 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:35,446 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:35,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash -317547734, now seen corresponding path program 1 times [2019-11-16 00:38:35,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:35,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350769062] [2019-11-16 00:38:35,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:35,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:35,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:35,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350769062] [2019-11-16 00:38:35,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:35,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:35,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045433099] [2019-11-16 00:38:35,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:35,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:35,506 INFO L87 Difference]: Start difference. First operand 1415 states and 2118 transitions. Second operand 3 states. [2019-11-16 00:38:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:35,632 INFO L93 Difference]: Finished difference Result 3271 states and 4910 transitions. [2019-11-16 00:38:35,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:35,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-16 00:38:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:35,634 INFO L225 Difference]: With dead ends: 3271 [2019-11-16 00:38:35,634 INFO L226 Difference]: Without dead ends: 1875 [2019-11-16 00:38:35,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-11-16 00:38:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1869. [2019-11-16 00:38:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2019-11-16 00:38:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2799 transitions. [2019-11-16 00:38:35,698 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2799 transitions. Word has length 167 [2019-11-16 00:38:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:35,698 INFO L462 AbstractCegarLoop]: Abstraction has 1869 states and 2799 transitions. [2019-11-16 00:38:35,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2799 transitions. [2019-11-16 00:38:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:35,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:35,700 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:35,700 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1811150326, now seen corresponding path program 1 times [2019-11-16 00:38:35,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:35,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408931491] [2019-11-16 00:38:35,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:35,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:35,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:38:35,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408931491] [2019-11-16 00:38:35,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:35,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:35,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765988453] [2019-11-16 00:38:35,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:35,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:35,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:35,760 INFO L87 Difference]: Start difference. First operand 1869 states and 2799 transitions. Second operand 3 states. [2019-11-16 00:38:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:35,920 INFO L93 Difference]: Finished difference Result 4140 states and 6210 transitions. [2019-11-16 00:38:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:35,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-16 00:38:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:35,922 INFO L225 Difference]: With dead ends: 4140 [2019-11-16 00:38:35,923 INFO L226 Difference]: Without dead ends: 2290 [2019-11-16 00:38:35,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-11-16 00:38:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2284. [2019-11-16 00:38:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-11-16 00:38:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3425 transitions. [2019-11-16 00:38:36,030 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3425 transitions. Word has length 172 [2019-11-16 00:38:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:36,030 INFO L462 AbstractCegarLoop]: Abstraction has 2284 states and 3425 transitions. [2019-11-16 00:38:36,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3425 transitions. [2019-11-16 00:38:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:36,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:36,032 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:36,032 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash 413118599, now seen corresponding path program 1 times [2019-11-16 00:38:36,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:36,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940502972] [2019-11-16 00:38:36,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:36,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:36,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:36,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940502972] [2019-11-16 00:38:36,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:36,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:36,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016910379] [2019-11-16 00:38:36,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:36,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:36,094 INFO L87 Difference]: Start difference. First operand 2284 states and 3425 transitions. Second operand 4 states. [2019-11-16 00:38:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:36,648 INFO L93 Difference]: Finished difference Result 4729 states and 7062 transitions. [2019-11-16 00:38:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:36,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-16 00:38:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:36,651 INFO L225 Difference]: With dead ends: 4729 [2019-11-16 00:38:36,651 INFO L226 Difference]: Without dead ends: 2464 [2019-11-16 00:38:36,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-11-16 00:38:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2284. [2019-11-16 00:38:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-11-16 00:38:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3420 transitions. [2019-11-16 00:38:36,747 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3420 transitions. Word has length 172 [2019-11-16 00:38:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:36,747 INFO L462 AbstractCegarLoop]: Abstraction has 2284 states and 3420 transitions. [2019-11-16 00:38:36,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3420 transitions. [2019-11-16 00:38:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:36,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:36,750 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:36,750 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2120350472, now seen corresponding path program 1 times [2019-11-16 00:38:36,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:36,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840725212] [2019-11-16 00:38:36,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:36,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:36,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:38:36,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840725212] [2019-11-16 00:38:36,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:36,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:36,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021864996] [2019-11-16 00:38:36,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:36,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:36,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:36,826 INFO L87 Difference]: Start difference. First operand 2284 states and 3420 transitions. Second operand 3 states. [2019-11-16 00:38:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:36,938 INFO L93 Difference]: Finished difference Result 4576 states and 6855 transitions. [2019-11-16 00:38:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:36,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-16 00:38:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:36,940 INFO L225 Difference]: With dead ends: 4576 [2019-11-16 00:38:36,940 INFO L226 Difference]: Without dead ends: 2311 [2019-11-16 00:38:36,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2019-11-16 00:38:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2019-11-16 00:38:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-11-16 00:38:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3455 transitions. [2019-11-16 00:38:37,025 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3455 transitions. Word has length 172 [2019-11-16 00:38:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:37,025 INFO L462 AbstractCegarLoop]: Abstraction has 2311 states and 3455 transitions. [2019-11-16 00:38:37,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3455 transitions. [2019-11-16 00:38:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:37,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:37,026 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:37,027 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:37,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash 769425146, now seen corresponding path program 1 times [2019-11-16 00:38:37,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:37,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256797292] [2019-11-16 00:38:37,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:37,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:37,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-16 00:38:37,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256797292] [2019-11-16 00:38:37,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:37,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:37,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966643448] [2019-11-16 00:38:37,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:37,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:37,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:37,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:37,073 INFO L87 Difference]: Start difference. First operand 2311 states and 3455 transitions. Second operand 3 states. [2019-11-16 00:38:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:37,202 INFO L93 Difference]: Finished difference Result 4145 states and 6201 transitions. [2019-11-16 00:38:37,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:37,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-16 00:38:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:37,204 INFO L225 Difference]: With dead ends: 4145 [2019-11-16 00:38:37,204 INFO L226 Difference]: Without dead ends: 1853 [2019-11-16 00:38:37,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-16 00:38:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2019-11-16 00:38:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2767 transitions. [2019-11-16 00:38:37,272 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2767 transitions. Word has length 172 [2019-11-16 00:38:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:37,272 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2767 transitions. [2019-11-16 00:38:37,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2767 transitions. [2019-11-16 00:38:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-16 00:38:37,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:37,274 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:37,274 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:37,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash 916128046, now seen corresponding path program 1 times [2019-11-16 00:38:37,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:37,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466231401] [2019-11-16 00:38:37,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:37,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:37,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:37,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466231401] [2019-11-16 00:38:37,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:37,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:37,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137353114] [2019-11-16 00:38:37,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:37,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:37,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:37,326 INFO L87 Difference]: Start difference. First operand 1853 states and 2767 transitions. Second operand 4 states. [2019-11-16 00:38:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:37,801 INFO L93 Difference]: Finished difference Result 3830 states and 5697 transitions. [2019-11-16 00:38:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:37,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-16 00:38:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:37,803 INFO L225 Difference]: With dead ends: 3830 [2019-11-16 00:38:37,804 INFO L226 Difference]: Without dead ends: 1998 [2019-11-16 00:38:37,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-11-16 00:38:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2019-11-16 00:38:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2763 transitions. [2019-11-16 00:38:37,873 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2763 transitions. Word has length 173 [2019-11-16 00:38:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:37,873 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2763 transitions. [2019-11-16 00:38:37,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2763 transitions. [2019-11-16 00:38:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:38:37,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:37,874 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:37,874 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash -553215436, now seen corresponding path program 1 times [2019-11-16 00:38:37,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:37,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110284705] [2019-11-16 00:38:37,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:37,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:37,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:37,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110284705] [2019-11-16 00:38:37,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:37,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:37,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199591481] [2019-11-16 00:38:37,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:37,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:37,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:37,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:37,939 INFO L87 Difference]: Start difference. First operand 1853 states and 2763 transitions. Second operand 4 states. [2019-11-16 00:38:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:38,289 INFO L93 Difference]: Finished difference Result 3754 states and 5585 transitions. [2019-11-16 00:38:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:38,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-16 00:38:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:38,291 INFO L225 Difference]: With dead ends: 3754 [2019-11-16 00:38:38,291 INFO L226 Difference]: Without dead ends: 1922 [2019-11-16 00:38:38,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2019-11-16 00:38:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1853. [2019-11-16 00:38:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2759 transitions. [2019-11-16 00:38:38,360 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2759 transitions. Word has length 174 [2019-11-16 00:38:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:38,360 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2759 transitions. [2019-11-16 00:38:38,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2759 transitions. [2019-11-16 00:38:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:38:38,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:38,361 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-11-16 00:38:38,362 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:38,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1043024855, now seen corresponding path program 1 times [2019-11-16 00:38:38,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:38,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71597948] [2019-11-16 00:38:38,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:38,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:38,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-16 00:38:38,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71597948] [2019-11-16 00:38:38,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:38,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:38,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244838358] [2019-11-16 00:38:38,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:38,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:38,410 INFO L87 Difference]: Start difference. First operand 1853 states and 2759 transitions. Second operand 4 states. [2019-11-16 00:38:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:38,769 INFO L93 Difference]: Finished difference Result 3782 states and 5625 transitions. [2019-11-16 00:38:38,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:38,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-16 00:38:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:38,771 INFO L225 Difference]: With dead ends: 3782 [2019-11-16 00:38:38,771 INFO L226 Difference]: Without dead ends: 1950 [2019-11-16 00:38:38,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-16 00:38:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1853. [2019-11-16 00:38:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2755 transitions. [2019-11-16 00:38:38,840 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2755 transitions. Word has length 174 [2019-11-16 00:38:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:38,840 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2755 transitions. [2019-11-16 00:38:38,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2755 transitions. [2019-11-16 00:38:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:38:38,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:38,842 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:38,842 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -117510462, now seen corresponding path program 1 times [2019-11-16 00:38:38,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:38,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166387119] [2019-11-16 00:38:38,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:38,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:38,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:38,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166387119] [2019-11-16 00:38:38,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:38,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:38,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913344952] [2019-11-16 00:38:38,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:38,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:38,888 INFO L87 Difference]: Start difference. First operand 1853 states and 2755 transitions. Second operand 4 states. [2019-11-16 00:38:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:39,295 INFO L93 Difference]: Finished difference Result 3830 states and 5673 transitions. [2019-11-16 00:38:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:39,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-16 00:38:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:39,296 INFO L225 Difference]: With dead ends: 3830 [2019-11-16 00:38:39,296 INFO L226 Difference]: Without dead ends: 1998 [2019-11-16 00:38:39,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-11-16 00:38:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2019-11-16 00:38:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2751 transitions. [2019-11-16 00:38:39,365 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2751 transitions. Word has length 174 [2019-11-16 00:38:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:39,365 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2751 transitions. [2019-11-16 00:38:39,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2751 transitions. [2019-11-16 00:38:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:38:39,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:39,366 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:39,366 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 573299101, now seen corresponding path program 1 times [2019-11-16 00:38:39,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:39,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189250769] [2019-11-16 00:38:39,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:39,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:39,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:39,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189250769] [2019-11-16 00:38:39,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:39,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:39,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508988654] [2019-11-16 00:38:39,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:39,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:39,430 INFO L87 Difference]: Start difference. First operand 1853 states and 2751 transitions. Second operand 4 states. [2019-11-16 00:38:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:39,782 INFO L93 Difference]: Finished difference Result 3746 states and 5553 transitions. [2019-11-16 00:38:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:39,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-16 00:38:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:39,784 INFO L225 Difference]: With dead ends: 3746 [2019-11-16 00:38:39,784 INFO L226 Difference]: Without dead ends: 1914 [2019-11-16 00:38:39,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-16 00:38:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1853. [2019-11-16 00:38:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2747 transitions. [2019-11-16 00:38:39,855 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2747 transitions. Word has length 175 [2019-11-16 00:38:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:39,855 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2747 transitions. [2019-11-16 00:38:39,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2747 transitions. [2019-11-16 00:38:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:38:39,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:39,856 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-11-16 00:38:39,856 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash 584650946, now seen corresponding path program 1 times [2019-11-16 00:38:39,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:39,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584548022] [2019-11-16 00:38:39,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:39,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:39,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-16 00:38:39,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584548022] [2019-11-16 00:38:39,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:39,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:39,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267831685] [2019-11-16 00:38:39,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:39,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:39,915 INFO L87 Difference]: Start difference. First operand 1853 states and 2747 transitions. Second operand 4 states. [2019-11-16 00:38:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:40,397 INFO L93 Difference]: Finished difference Result 3774 states and 5593 transitions. [2019-11-16 00:38:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:40,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-16 00:38:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:40,399 INFO L225 Difference]: With dead ends: 3774 [2019-11-16 00:38:40,399 INFO L226 Difference]: Without dead ends: 1942 [2019-11-16 00:38:40,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-11-16 00:38:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1853. [2019-11-16 00:38:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2743 transitions. [2019-11-16 00:38:40,471 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2743 transitions. Word has length 175 [2019-11-16 00:38:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:40,471 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2743 transitions. [2019-11-16 00:38:40,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2743 transitions. [2019-11-16 00:38:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:38:40,472 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:40,472 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:40,472 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1542595319, now seen corresponding path program 1 times [2019-11-16 00:38:40,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:40,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075210437] [2019-11-16 00:38:40,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:40,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:40,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:40,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075210437] [2019-11-16 00:38:40,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:40,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:40,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098962761] [2019-11-16 00:38:40,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:40,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:40,521 INFO L87 Difference]: Start difference. First operand 1853 states and 2743 transitions. Second operand 4 states. [2019-11-16 00:38:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:40,905 INFO L93 Difference]: Finished difference Result 3790 states and 5601 transitions. [2019-11-16 00:38:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:40,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-16 00:38:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:40,907 INFO L225 Difference]: With dead ends: 3790 [2019-11-16 00:38:40,907 INFO L226 Difference]: Without dead ends: 1958 [2019-11-16 00:38:40,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-11-16 00:38:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1853. [2019-11-16 00:38:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-16 00:38:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2739 transitions. [2019-11-16 00:38:40,981 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2739 transitions. Word has length 175 [2019-11-16 00:38:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:40,982 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2739 transitions. [2019-11-16 00:38:40,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2739 transitions. [2019-11-16 00:38:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:38:40,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:40,983 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:40,983 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 198256685, now seen corresponding path program 1 times [2019-11-16 00:38:40,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:40,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437349026] [2019-11-16 00:38:40,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:40,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:40,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:41,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437349026] [2019-11-16 00:38:41,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:41,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:41,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739029814] [2019-11-16 00:38:41,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:41,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:41,089 INFO L87 Difference]: Start difference. First operand 1853 states and 2739 transitions. Second operand 5 states. [2019-11-16 00:38:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:41,605 INFO L93 Difference]: Finished difference Result 4139 states and 6141 transitions. [2019-11-16 00:38:41,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:41,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-11-16 00:38:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:41,615 INFO L225 Difference]: With dead ends: 4139 [2019-11-16 00:38:41,615 INFO L226 Difference]: Without dead ends: 2307 [2019-11-16 00:38:41,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-16 00:38:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2012. [2019-11-16 00:38:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-11-16 00:38:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3026 transitions. [2019-11-16 00:38:41,690 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3026 transitions. Word has length 177 [2019-11-16 00:38:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:41,690 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 3026 transitions. [2019-11-16 00:38:41,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3026 transitions. [2019-11-16 00:38:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-16 00:38:41,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:41,691 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:41,692 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash -128602397, now seen corresponding path program 1 times [2019-11-16 00:38:41,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:41,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161533774] [2019-11-16 00:38:41,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:41,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:41,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:41,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161533774] [2019-11-16 00:38:41,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:41,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:41,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932186558] [2019-11-16 00:38:41,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:41,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:41,789 INFO L87 Difference]: Start difference. First operand 2012 states and 3026 transitions. Second operand 5 states. [2019-11-16 00:38:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:42,302 INFO L93 Difference]: Finished difference Result 4410 states and 6648 transitions. [2019-11-16 00:38:42,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:42,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-11-16 00:38:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:42,303 INFO L225 Difference]: With dead ends: 4410 [2019-11-16 00:38:42,303 INFO L226 Difference]: Without dead ends: 2419 [2019-11-16 00:38:42,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2019-11-16 00:38:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2122. [2019-11-16 00:38:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-16 00:38:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3248 transitions. [2019-11-16 00:38:42,381 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3248 transitions. Word has length 178 [2019-11-16 00:38:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:42,381 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3248 transitions. [2019-11-16 00:38:42,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3248 transitions. [2019-11-16 00:38:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:38:42,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:42,383 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:42,383 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash -542208661, now seen corresponding path program 1 times [2019-11-16 00:38:42,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:42,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233691348] [2019-11-16 00:38:42,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:42,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:42,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:42,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233691348] [2019-11-16 00:38:42,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:42,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:42,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078781449] [2019-11-16 00:38:42,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:42,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:42,450 INFO L87 Difference]: Start difference. First operand 2122 states and 3248 transitions. Second operand 4 states. [2019-11-16 00:38:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:42,818 INFO L93 Difference]: Finished difference Result 4309 states and 6583 transitions. [2019-11-16 00:38:42,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:42,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-16 00:38:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:42,820 INFO L225 Difference]: With dead ends: 4309 [2019-11-16 00:38:42,820 INFO L226 Difference]: Without dead ends: 2208 [2019-11-16 00:38:42,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-11-16 00:38:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2122. [2019-11-16 00:38:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-16 00:38:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3245 transitions. [2019-11-16 00:38:42,923 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3245 transitions. Word has length 179 [2019-11-16 00:38:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:42,923 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3245 transitions. [2019-11-16 00:38:42,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3245 transitions. [2019-11-16 00:38:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-16 00:38:42,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:42,924 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:42,924 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash 914509126, now seen corresponding path program 1 times [2019-11-16 00:38:42,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:42,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967134906] [2019-11-16 00:38:42,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:42,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:42,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:42,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967134906] [2019-11-16 00:38:42,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:42,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:42,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655805097] [2019-11-16 00:38:42,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:42,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:42,989 INFO L87 Difference]: Start difference. First operand 2122 states and 3245 transitions. Second operand 4 states. [2019-11-16 00:38:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:43,400 INFO L93 Difference]: Finished difference Result 4303 states and 6571 transitions. [2019-11-16 00:38:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:43,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-16 00:38:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:43,402 INFO L225 Difference]: With dead ends: 4303 [2019-11-16 00:38:43,402 INFO L226 Difference]: Without dead ends: 2202 [2019-11-16 00:38:43,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2019-11-16 00:38:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2122. [2019-11-16 00:38:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-16 00:38:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3242 transitions. [2019-11-16 00:38:43,480 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3242 transitions. Word has length 180 [2019-11-16 00:38:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:43,480 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3242 transitions. [2019-11-16 00:38:43,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3242 transitions. [2019-11-16 00:38:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-16 00:38:43,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:43,482 INFO L380 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] [2019-11-16 00:38:43,482 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:43,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:43,482 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2019-11-16 00:38:43,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:43,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214482571] [2019-11-16 00:38:43,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:43,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:43,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:43,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214482571] [2019-11-16 00:38:43,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071539501] [2019-11-16 00:38:43,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:44,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-16 00:38:44,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:44,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-16 00:38:44,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,445 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-16 00:38:44,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:38:44,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:38:44,560 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,617 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:44,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11-16 00:38:44,618 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,637 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-16 00:38:44,705 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:44,705 INFO L375 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-11-16 00:38:44,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:44,775 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:44,776 INFO L375 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-11-16 00:38:44,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:44,795 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-11-16 00:38:44,800 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:44,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,885 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:38:44,885 INFO L375 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-11-16 00:38:44,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:38:44,946 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:44,947 INFO L375 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-11-16 00:38:44,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:44,998 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:44,998 INFO L375 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-11-16 00:38:44,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:45,022 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-16 00:38:45,025 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:45,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,102 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:38:45,102 INFO L375 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-11-16 00:38:45,103 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:38:45,126 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-16 00:38:45,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-16 00:38:45,130 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:45,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,264 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-16 00:38:45,264 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-16 00:38:45,264 INFO L375 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-11-16 00:38:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:45,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:45,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-16 00:38:45,387 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-16 00:38:45,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-16 00:38:45,390 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-16 00:38:45,393 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:45,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,477 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:38:45,477 INFO L375 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-11-16 00:38:45,478 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:38:45,493 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-16 00:38:45,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-16 00:38:45,503 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:45,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,661 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-16 00:38:45,661 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-16 00:38:45,661 INFO L375 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-11-16 00:38:45,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:45,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,710 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-16 00:38:45,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-16 00:38:45,716 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-11-16 00:38:45,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,742 INFO L375 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-11-16 00:38:45,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-16 00:38:45,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 62 [2019-11-16 00:38:45,879 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,912 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:45,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,943 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:45,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,979 INFO L375 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-11-16 00:38:45,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:45,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,005 INFO L375 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-11-16 00:38:46,006 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:46,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,128 INFO L341 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-16 00:38:46,128 INFO L375 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-11-16 00:38:46,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,132 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:46,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,147 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:46,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:46,178 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-11-16 00:38:46,229 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-11-16 00:38:46,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-11-16 00:38:46,236 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:46,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:46,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-16 00:38:46,266 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:46,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,295 INFO L341 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-16 00:38:46,295 INFO L375 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-11-16 00:38:46,296 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:46,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:46,306 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-11-16 00:38:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:46,719 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:38:46,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-16 00:38:46,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299584343] [2019-11-16 00:38:46,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:38:46,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:38:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:38:46,729 INFO L87 Difference]: Start difference. First operand 2122 states and 3242 transitions. Second operand 13 states. [2019-11-16 00:38:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:51,194 INFO L93 Difference]: Finished difference Result 9228 states and 13980 transitions. [2019-11-16 00:38:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:38:51,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 191 [2019-11-16 00:38:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:51,207 INFO L225 Difference]: With dead ends: 9228 [2019-11-16 00:38:51,208 INFO L226 Difference]: Without dead ends: 7127 [2019-11-16 00:38:51,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:38:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2019-11-16 00:38:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 4825. [2019-11-16 00:38:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2019-11-16 00:38:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7543 transitions. [2019-11-16 00:38:51,526 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7543 transitions. Word has length 191 [2019-11-16 00:38:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:51,527 INFO L462 AbstractCegarLoop]: Abstraction has 4825 states and 7543 transitions. [2019-11-16 00:38:51,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:38:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7543 transitions. [2019-11-16 00:38:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:38:51,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:51,533 INFO L380 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] [2019-11-16 00:38:51,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:51,739 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash 877150553, now seen corresponding path program 1 times [2019-11-16 00:38:51,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:51,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894112266] [2019-11-16 00:38:51,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:51,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:51,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-16 00:38:51,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894112266] [2019-11-16 00:38:51,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:51,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:51,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29985656] [2019-11-16 00:38:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:51,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:51,852 INFO L87 Difference]: Start difference. First operand 4825 states and 7543 transitions. Second operand 4 states. [2019-11-16 00:38:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:52,460 INFO L93 Difference]: Finished difference Result 9839 states and 15340 transitions. [2019-11-16 00:38:52,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:52,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-16 00:38:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:52,465 INFO L225 Difference]: With dead ends: 9839 [2019-11-16 00:38:52,465 INFO L226 Difference]: Without dead ends: 5035 [2019-11-16 00:38:52,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5035 states. [2019-11-16 00:38:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5035 to 4825. [2019-11-16 00:38:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2019-11-16 00:38:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7535 transitions. [2019-11-16 00:38:52,712 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7535 transitions. Word has length 199 [2019-11-16 00:38:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:52,712 INFO L462 AbstractCegarLoop]: Abstraction has 4825 states and 7535 transitions. [2019-11-16 00:38:52,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7535 transitions. [2019-11-16 00:38:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-16 00:38:52,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:52,716 INFO L380 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] [2019-11-16 00:38:52,716 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:52,717 INFO L82 PathProgramCache]: Analyzing trace with hash -19453550, now seen corresponding path program 1 times [2019-11-16 00:38:52,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:52,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365805008] [2019-11-16 00:38:52,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:52,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:52,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-16 00:38:52,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365805008] [2019-11-16 00:38:52,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:52,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:52,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770639996] [2019-11-16 00:38:52,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:52,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:52,802 INFO L87 Difference]: Start difference. First operand 4825 states and 7535 transitions. Second operand 4 states. [2019-11-16 00:38:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:53,575 INFO L93 Difference]: Finished difference Result 9823 states and 15308 transitions. [2019-11-16 00:38:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:53,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-16 00:38:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:53,581 INFO L225 Difference]: With dead ends: 9823 [2019-11-16 00:38:53,581 INFO L226 Difference]: Without dead ends: 5019 [2019-11-16 00:38:53,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2019-11-16 00:38:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 4825. [2019-11-16 00:38:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2019-11-16 00:38:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7527 transitions. [2019-11-16 00:38:53,797 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7527 transitions. Word has length 200 [2019-11-16 00:38:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:53,797 INFO L462 AbstractCegarLoop]: Abstraction has 4825 states and 7527 transitions. [2019-11-16 00:38:53,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7527 transitions. [2019-11-16 00:38:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-16 00:38:53,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:53,801 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:53,801 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash 477049331, now seen corresponding path program 1 times [2019-11-16 00:38:53,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:53,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640611265] [2019-11-16 00:38:53,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:53,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:53,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-11-16 00:38:53,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640611265] [2019-11-16 00:38:53,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:53,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:38:53,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595089557] [2019-11-16 00:38:53,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:38:53,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:38:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:53,930 INFO L87 Difference]: Start difference. First operand 4825 states and 7527 transitions. Second operand 6 states. [2019-11-16 00:38:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:55,206 INFO L93 Difference]: Finished difference Result 10869 states and 16887 transitions. [2019-11-16 00:38:55,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:55,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-11-16 00:38:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:55,211 INFO L225 Difference]: With dead ends: 10869 [2019-11-16 00:38:55,211 INFO L226 Difference]: Without dead ends: 6065 [2019-11-16 00:38:55,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2019-11-16 00:38:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 4725. [2019-11-16 00:38:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-16 00:38:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7327 transitions. [2019-11-16 00:38:55,411 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7327 transitions. Word has length 204 [2019-11-16 00:38:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:55,411 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7327 transitions. [2019-11-16 00:38:55,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:38:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7327 transitions. [2019-11-16 00:38:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-16 00:38:55,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:55,413 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:55,414 INFO L410 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash 462310456, now seen corresponding path program 1 times [2019-11-16 00:38:55,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:55,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925981554] [2019-11-16 00:38:55,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:55,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:55,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-16 00:38:55,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925981554] [2019-11-16 00:38:55,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:55,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:38:55,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137135745] [2019-11-16 00:38:55,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:38:55,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:38:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:55,537 INFO L87 Difference]: Start difference. First operand 4725 states and 7327 transitions. Second operand 6 states. [2019-11-16 00:38:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:56,608 INFO L93 Difference]: Finished difference Result 10401 states and 16019 transitions. [2019-11-16 00:38:56,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:56,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-11-16 00:38:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:56,613 INFO L225 Difference]: With dead ends: 10401 [2019-11-16 00:38:56,613 INFO L226 Difference]: Without dead ends: 5697 [2019-11-16 00:38:56,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2019-11-16 00:38:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 4729. [2019-11-16 00:38:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4729 states. [2019-11-16 00:38:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 7315 transitions. [2019-11-16 00:38:56,801 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 7315 transitions. Word has length 205 [2019-11-16 00:38:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:56,801 INFO L462 AbstractCegarLoop]: Abstraction has 4729 states and 7315 transitions. [2019-11-16 00:38:56,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:38:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 7315 transitions. [2019-11-16 00:38:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-16 00:38:56,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:56,804 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:56,804 INFO L410 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:56,804 INFO L82 PathProgramCache]: Analyzing trace with hash -412411121, now seen corresponding path program 1 times [2019-11-16 00:38:56,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:56,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44275580] [2019-11-16 00:38:56,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:56,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:56,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:56,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44275580] [2019-11-16 00:38:56,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:56,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:56,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922531052] [2019-11-16 00:38:56,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:56,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:56,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:56,928 INFO L87 Difference]: Start difference. First operand 4729 states and 7315 transitions. Second operand 5 states. [2019-11-16 00:38:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:57,711 INFO L93 Difference]: Finished difference Result 10369 states and 16037 transitions. [2019-11-16 00:38:57,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:57,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-11-16 00:38:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:57,715 INFO L225 Difference]: With dead ends: 10369 [2019-11-16 00:38:57,715 INFO L226 Difference]: Without dead ends: 5661 [2019-11-16 00:38:57,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2019-11-16 00:38:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5025. [2019-11-16 00:38:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-11-16 00:38:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7835 transitions. [2019-11-16 00:38:57,898 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7835 transitions. Word has length 211 [2019-11-16 00:38:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:57,898 INFO L462 AbstractCegarLoop]: Abstraction has 5025 states and 7835 transitions. [2019-11-16 00:38:57,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7835 transitions. [2019-11-16 00:38:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-16 00:38:57,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:57,903 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:57,903 INFO L410 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash -760223515, now seen corresponding path program 1 times [2019-11-16 00:38:57,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:57,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938072615] [2019-11-16 00:38:57,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:57,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:57,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:58,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938072615] [2019-11-16 00:38:58,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:58,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:58,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181317628] [2019-11-16 00:38:58,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:58,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:58,036 INFO L87 Difference]: Start difference. First operand 5025 states and 7835 transitions. Second operand 5 states. [2019-11-16 00:38:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:58,717 INFO L93 Difference]: Finished difference Result 10641 states and 16509 transitions. [2019-11-16 00:38:58,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:58,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-16 00:38:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:58,722 INFO L225 Difference]: With dead ends: 10641 [2019-11-16 00:38:58,722 INFO L226 Difference]: Without dead ends: 5637 [2019-11-16 00:38:58,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2019-11-16 00:38:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5013. [2019-11-16 00:38:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5013 states. [2019-11-16 00:38:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 7807 transitions. [2019-11-16 00:38:58,934 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 7807 transitions. Word has length 212 [2019-11-16 00:38:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:58,935 INFO L462 AbstractCegarLoop]: Abstraction has 5013 states and 7807 transitions. [2019-11-16 00:38:58,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 7807 transitions. [2019-11-16 00:38:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-16 00:38:58,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:58,938 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:58,939 INFO L410 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2003024104, now seen corresponding path program 1 times [2019-11-16 00:38:58,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:58,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874351940] [2019-11-16 00:38:58,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:58,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:58,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-16 00:38:59,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874351940] [2019-11-16 00:38:59,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527760436] [2019-11-16 00:38:59,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/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-11-16 00:38:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:59,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:38:59,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:59,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:38:59,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:59,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:59,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:59,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:38:59,420 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_163|], 5=[|v_#memory_int_180|]} [2019-11-16 00:38:59,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-16 00:38:59,422 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:59,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:59,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-16 00:38:59,428 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:59,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:59,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:59,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-16 00:38:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:59,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:59,688 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:38:59,691 INFO L168 Benchmark]: Toolchain (without parser) took 75629.93 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 940.6 MB in the beginning and 1.9 GB in the end (delta: -993.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:59,692 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:38:59,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:59,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:59,692 INFO L168 Benchmark]: Boogie Preprocessor took 134.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:59,693 INFO L168 Benchmark]: RCFGBuilder took 1201.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:59,693 INFO L168 Benchmark]: TraceAbstraction took 73465.94 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 998.7 MB in the beginning and 1.9 GB in the end (delta: -935.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:59,694 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 733.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.00 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 134.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1201.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73465.94 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 998.7 MB in the beginning and 1.9 GB in the end (delta: -935.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:39:01,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:39:01,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:39:02,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:39:02,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:39:02,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:39:02,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:39:02,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:39:02,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:39:02,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:39:02,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:39:02,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:39:02,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:39:02,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:39:02,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:39:02,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:39:02,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:39:02,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:39:02,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:39:02,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:39:02,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:39:02,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:39:02,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:39:02,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:39:02,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:39:02,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:39:02,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:39:02,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:39:02,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:39:02,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:39:02,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:39:02,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:39:02,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:39:02,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:39:02,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:39:02,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:39:02,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:39:02,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:39:02,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:39:02,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:39:02,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:39:02,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:39:02,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:39:02,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:39:02,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:39:02,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:39:02,081 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:39:02,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:39:02,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:39:02,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:39:02,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:39:02,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:39:02,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:39:02,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:39:02,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:39:02,084 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:39:02,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:39:02,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:39:02,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:39:02,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:39:02,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:39:02,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:39:02,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:39:02,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:39:02,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:39:02,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:39:02,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:39:02,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:39:02,088 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:39:02,088 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:39:02,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:39:02,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:39:02,089 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_c0f2634f-8016-460a-a77d-f872e5a1a2a9/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-11-16 00:39:02,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:39:02,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:39:02,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:39:02,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:39:02,175 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:39:02,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-16 00:39:02,246 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/f7b0a7c0e/7d069bd5ca2b45b1a9ebb8f00ce71bee/FLAG7492ce232 [2019-11-16 00:39:02,864 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:39:02,864 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-16 00:39:02,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/f7b0a7c0e/7d069bd5ca2b45b1a9ebb8f00ce71bee/FLAG7492ce232 [2019-11-16 00:39:03,093 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/data/f7b0a7c0e/7d069bd5ca2b45b1a9ebb8f00ce71bee [2019-11-16 00:39:03,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:39:03,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:39:03,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:03,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:39:03,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:39:03,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:03" (1/1) ... [2019-11-16 00:39:03,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543d201a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:03, skipping insertion in model container [2019-11-16 00:39:03,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:03" (1/1) ... [2019-11-16 00:39:03,117 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:39:03,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:39:03,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:03,919 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:39:04,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:04,156 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:39:04,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04 WrapperNode [2019-11-16 00:39:04,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:04,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:04,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:39:04,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:39:04,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:04,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:39:04,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:39:04,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:39:04,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2019-11-16 00:39:04,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:39:04,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:39:04,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:39:04,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:39:04,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:39:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:39:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:39:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:39:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:39:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:39:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:39:04,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:39:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:39:04,650 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:39:08,834 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:39:08,834 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:39:08,835 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:39:08,835 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:39:08,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:08 BoogieIcfgContainer [2019-11-16 00:39:08,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:39:08,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:39:08,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:39:08,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:39:08,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:03" (1/3) ... [2019-11-16 00:39:08,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcda620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:08, skipping insertion in model container [2019-11-16 00:39:08,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (2/3) ... [2019-11-16 00:39:08,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcda620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:08, skipping insertion in model container [2019-11-16 00:39:08,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:08" (3/3) ... [2019-11-16 00:39:08,844 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-11-16 00:39:08,854 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:39:08,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:39:08,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:39:08,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:39:08,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:39:08,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:39:08,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:39:08,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:39:08,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:39:08,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:39:08,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:39:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-16 00:39:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:39:08,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:08,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:08,922 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2019-11-16 00:39:08,939 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:08,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1513326362] [2019-11-16 00:39:08,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:09,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:09,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:09,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:09,370 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:09,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:09,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:09,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,433 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:09,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:09,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:09,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:09,506 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:09,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513326362] [2019-11-16 00:39:09,563 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:09,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:09,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896486103] [2019-11-16 00:39:09,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:09,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:09,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:09,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:09,583 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 6 states. [2019-11-16 00:39:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:19,671 INFO L93 Difference]: Finished difference Result 538 states and 918 transitions. [2019-11-16 00:39:19,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:19,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-16 00:39:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:19,691 INFO L225 Difference]: With dead ends: 538 [2019-11-16 00:39:19,691 INFO L226 Difference]: Without dead ends: 357 [2019-11-16 00:39:19,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 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-11-16 00:39:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-16 00:39:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 178. [2019-11-16 00:39:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-16 00:39:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 286 transitions. [2019-11-16 00:39:19,748 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 286 transitions. Word has length 43 [2019-11-16 00:39:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:19,749 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 286 transitions. [2019-11-16 00:39:19,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 286 transitions. [2019-11-16 00:39:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:39:19,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:19,752 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:19,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:19,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:19,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash -56015273, now seen corresponding path program 1 times [2019-11-16 00:39:19,965 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:19,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [795309750] [2019-11-16 00:39:19,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:20,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:20,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:20,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:20,263 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:20,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:20,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:20,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:20,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:20,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:20,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:20,310 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:20,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:20,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:20,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:20,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:20,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:20,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:20,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:20,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:20,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:20,355 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:20,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [795309750] [2019-11-16 00:39:20,402 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:20,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:20,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273852706] [2019-11-16 00:39:20,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:20,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:20,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:20,405 INFO L87 Difference]: Start difference. First operand 178 states and 286 transitions. Second operand 6 states. [2019-11-16 00:39:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:28,174 INFO L93 Difference]: Finished difference Result 558 states and 889 transitions. [2019-11-16 00:39:28,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:28,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-16 00:39:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:28,179 INFO L225 Difference]: With dead ends: 558 [2019-11-16 00:39:28,179 INFO L226 Difference]: Without dead ends: 388 [2019-11-16 00:39:28,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 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-11-16 00:39:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-16 00:39:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 218. [2019-11-16 00:39:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-16 00:39:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 360 transitions. [2019-11-16 00:39:28,197 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 360 transitions. Word has length 44 [2019-11-16 00:39:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:28,197 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 360 transitions. [2019-11-16 00:39:28,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 360 transitions. [2019-11-16 00:39:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:39:28,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:28,201 INFO L380 BasicCegarLoop]: trace histogram [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-11-16 00:39:28,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:28,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1051223893, now seen corresponding path program 1 times [2019-11-16 00:39:28,405 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:28,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1081693399] [2019-11-16 00:39:28,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:28,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:28,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:28,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:28,817 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:28,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:28,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:28,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:28,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:28,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:28,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:28,858 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:28,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:28,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:28,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:28,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:28,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:28,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:28,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:28,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:28,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:28,912 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:28,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1081693399] [2019-11-16 00:39:28,972 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:28,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:28,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602225157] [2019-11-16 00:39:28,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:28,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:28,974 INFO L87 Difference]: Start difference. First operand 218 states and 360 transitions. Second operand 6 states. [2019-11-16 00:39:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:34,710 INFO L93 Difference]: Finished difference Result 671 states and 1099 transitions. [2019-11-16 00:39:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:34,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-16 00:39:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:34,714 INFO L225 Difference]: With dead ends: 671 [2019-11-16 00:39:34,714 INFO L226 Difference]: Without dead ends: 461 [2019-11-16 00:39:34,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 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-11-16 00:39:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-16 00:39:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 282. [2019-11-16 00:39:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-16 00:39:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 476 transitions. [2019-11-16 00:39:34,734 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 476 transitions. Word has length 72 [2019-11-16 00:39:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:34,735 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 476 transitions. [2019-11-16 00:39:34,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 476 transitions. [2019-11-16 00:39:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:39:34,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:34,738 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-16 00:39:34,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:34,941 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1753956891, now seen corresponding path program 1 times [2019-11-16 00:39:34,942 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:34,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1707087128] [2019-11-16 00:39:34,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:35,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:35,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:35,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:35,300 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:35,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:35,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:35,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:35,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:35,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:35,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:35,338 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:35,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:35,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:35,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:35,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:35,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:35,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:35,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:35,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:35,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:35,394 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:35,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1707087128] [2019-11-16 00:39:35,460 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:35,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:35,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23204662] [2019-11-16 00:39:35,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:35,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:35,463 INFO L87 Difference]: Start difference. First operand 282 states and 476 transitions. Second operand 6 states. [2019-11-16 00:39:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:41,682 INFO L93 Difference]: Finished difference Result 763 states and 1260 transitions. [2019-11-16 00:39:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:41,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-11-16 00:39:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:41,686 INFO L225 Difference]: With dead ends: 763 [2019-11-16 00:39:41,686 INFO L226 Difference]: Without dead ends: 489 [2019-11-16 00:39:41,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 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-11-16 00:39:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-16 00:39:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 319. [2019-11-16 00:39:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-16 00:39:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 542 transitions. [2019-11-16 00:39:41,703 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 542 transitions. Word has length 77 [2019-11-16 00:39:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:41,703 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 542 transitions. [2019-11-16 00:39:41,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 542 transitions. [2019-11-16 00:39:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:39:41,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:41,707 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2019-11-16 00:39:41,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:41,911 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1972675417, now seen corresponding path program 1 times [2019-11-16 00:39:41,912 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:41,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [479850575] [2019-11-16 00:39:41,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:42,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:42,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:42,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:42,355 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:42,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:42,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:42,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:42,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:42,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:42,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:42,399 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:42,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:42,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:42,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:42,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:42,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:42,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:42,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:42,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:42,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:42,434 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:42,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [479850575] [2019-11-16 00:39:42,482 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:42,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:42,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626493205] [2019-11-16 00:39:42,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:42,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:42,484 INFO L87 Difference]: Start difference. First operand 319 states and 542 transitions. Second operand 6 states. [2019-11-16 00:39:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:48,664 INFO L93 Difference]: Finished difference Result 795 states and 1317 transitions. [2019-11-16 00:39:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:48,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-11-16 00:39:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:48,668 INFO L225 Difference]: With dead ends: 795 [2019-11-16 00:39:48,668 INFO L226 Difference]: Without dead ends: 484 [2019-11-16 00:39:48,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 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-11-16 00:39:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-11-16 00:39:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 319. [2019-11-16 00:39:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-16 00:39:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 540 transitions. [2019-11-16 00:39:48,696 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 540 transitions. Word has length 78 [2019-11-16 00:39:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:48,697 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 540 transitions. [2019-11-16 00:39:48,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 540 transitions. [2019-11-16 00:39:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:39:48,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:48,702 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:48,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:48,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash 950146036, now seen corresponding path program 1 times [2019-11-16 00:39:48,916 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:48,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [568328760] [2019-11-16 00:39:48,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:49,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:49,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:49,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:49,440 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:49,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:49,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:49,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,461 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:49,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:49,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:49,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:49,490 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:49,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [568328760] [2019-11-16 00:39:49,543 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:49,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:49,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825095489] [2019-11-16 00:39:49,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:49,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:49,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:49,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:49,545 INFO L87 Difference]: Start difference. First operand 319 states and 540 transitions. Second operand 6 states. [2019-11-16 00:39:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:56,643 INFO L93 Difference]: Finished difference Result 835 states and 1382 transitions. [2019-11-16 00:39:56,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:56,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-16 00:39:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:56,648 INFO L225 Difference]: With dead ends: 835 [2019-11-16 00:39:56,649 INFO L226 Difference]: Without dead ends: 524 [2019-11-16 00:39:56,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 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-11-16 00:39:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-11-16 00:39:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 335. [2019-11-16 00:39:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-16 00:39:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 562 transitions. [2019-11-16 00:39:56,665 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 562 transitions. Word has length 85 [2019-11-16 00:39:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:56,667 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 562 transitions. [2019-11-16 00:39:56,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 562 transitions. [2019-11-16 00:39:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:39:56,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:56,670 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:56,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:56,882 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2051560873, now seen corresponding path program 1 times [2019-11-16 00:39:56,883 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:56,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [113198051] [2019-11-16 00:39:56,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:57,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:57,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:57,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:57,332 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:57,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:57,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:57,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:57,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:57,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:57,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:57,358 INFO L375 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 31 treesize of output 24 [2019-11-16 00:39:57,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:57,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:57,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:57,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:57,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:39:57,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:57,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:57,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:57,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:57,396 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:57,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [113198051] [2019-11-16 00:39:57,454 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:57,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:57,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913866271] [2019-11-16 00:39:57,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:57,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:57,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:57,456 INFO L87 Difference]: Start difference. First operand 335 states and 562 transitions. Second operand 6 states. [2019-11-16 00:40:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:02,877 INFO L93 Difference]: Finished difference Result 825 states and 1353 transitions. [2019-11-16 00:40:02,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:02,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-16 00:40:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:02,881 INFO L225 Difference]: With dead ends: 825 [2019-11-16 00:40:02,881 INFO L226 Difference]: Without dead ends: 498 [2019-11-16 00:40:02,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 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-11-16 00:40:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-16 00:40:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 335. [2019-11-16 00:40:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-16 00:40:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 557 transitions. [2019-11-16 00:40:02,892 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 557 transitions. Word has length 86 [2019-11-16 00:40:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:02,893 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 557 transitions. [2019-11-16 00:40:02,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 557 transitions. [2019-11-16 00:40:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:40:02,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:02,894 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-11-16 00:40:03,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:03,099 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:03,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:03,099 INFO L82 PathProgramCache]: Analyzing trace with hash 249927561, now seen corresponding path program 1 times [2019-11-16 00:40:03,099 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:03,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1598241159] [2019-11-16 00:40:03,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:03,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:03,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:03,252 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:03,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1598241159] [2019-11-16 00:40:03,260 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:03,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:40:03,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848687914] [2019-11-16 00:40:03,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:03,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:03,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:03,261 INFO L87 Difference]: Start difference. First operand 335 states and 557 transitions. Second operand 3 states. [2019-11-16 00:40:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:03,849 INFO L93 Difference]: Finished difference Result 982 states and 1640 transitions. [2019-11-16 00:40:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:03,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-16 00:40:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:03,852 INFO L225 Difference]: With dead ends: 982 [2019-11-16 00:40:03,853 INFO L226 Difference]: Without dead ends: 655 [2019-11-16 00:40:03,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-16 00:40:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-16 00:40:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-16 00:40:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1083 transitions. [2019-11-16 00:40:03,873 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1083 transitions. Word has length 86 [2019-11-16 00:40:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:03,874 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 1083 transitions. [2019-11-16 00:40:03,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1083 transitions. [2019-11-16 00:40:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:40:03,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:03,876 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-11-16 00:40:04,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:04,080 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -284914922, now seen corresponding path program 1 times [2019-11-16 00:40:04,081 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:04,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1701788564] [2019-11-16 00:40:04,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:04,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:04,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:04,241 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:04,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701788564] [2019-11-16 00:40:04,254 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:04,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:40:04,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497081957] [2019-11-16 00:40:04,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:04,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:04,256 INFO L87 Difference]: Start difference. First operand 655 states and 1083 transitions. Second operand 3 states. [2019-11-16 00:40:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:04,649 INFO L93 Difference]: Finished difference Result 1623 states and 2694 transitions. [2019-11-16 00:40:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:04,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-16 00:40:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:04,656 INFO L225 Difference]: With dead ends: 1623 [2019-11-16 00:40:04,656 INFO L226 Difference]: Without dead ends: 976 [2019-11-16 00:40:04,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-16 00:40:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2019-11-16 00:40:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-16 00:40:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1610 transitions. [2019-11-16 00:40:04,684 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1610 transitions. Word has length 87 [2019-11-16 00:40:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:04,684 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1610 transitions. [2019-11-16 00:40:04,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1610 transitions. [2019-11-16 00:40:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:40:04,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:04,687 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1] [2019-11-16 00:40:04,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:04,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1928645906, now seen corresponding path program 1 times [2019-11-16 00:40:04,892 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:04,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [51059958] [2019-11-16 00:40:04,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:05,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:05,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:05,064 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:05,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [51059958] [2019-11-16 00:40:05,075 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:05,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:40:05,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641295217] [2019-11-16 00:40:05,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:05,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:05,077 INFO L87 Difference]: Start difference. First operand 976 states and 1610 transitions. Second operand 3 states. [2019-11-16 00:40:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:06,432 INFO L93 Difference]: Finished difference Result 2266 states and 3750 transitions. [2019-11-16 00:40:06,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:06,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-16 00:40:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:06,440 INFO L225 Difference]: With dead ends: 2266 [2019-11-16 00:40:06,440 INFO L226 Difference]: Without dead ends: 1298 [2019-11-16 00:40:06,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-11-16 00:40:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2019-11-16 00:40:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2019-11-16 00:40:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2138 transitions. [2019-11-16 00:40:06,475 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2138 transitions. Word has length 88 [2019-11-16 00:40:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:06,475 INFO L462 AbstractCegarLoop]: Abstraction has 1298 states and 2138 transitions. [2019-11-16 00:40:06,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2138 transitions. [2019-11-16 00:40:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:40:06,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:06,478 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-16 00:40:06,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:06,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:06,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash 706785243, now seen corresponding path program 1 times [2019-11-16 00:40:06,682 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:06,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [617392993] [2019-11-16 00:40:06,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:06,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:06,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:06,862 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:06,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [617392993] [2019-11-16 00:40:06,887 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:06,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:40:06,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909853204] [2019-11-16 00:40:06,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:06,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:06,892 INFO L87 Difference]: Start difference. First operand 1298 states and 2138 transitions. Second operand 4 states. [2019-11-16 00:40:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:07,049 INFO L93 Difference]: Finished difference Result 3199 states and 5286 transitions. [2019-11-16 00:40:07,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:07,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:40:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:07,060 INFO L225 Difference]: With dead ends: 3199 [2019-11-16 00:40:07,060 INFO L226 Difference]: Without dead ends: 1909 [2019-11-16 00:40:07,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-11-16 00:40:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1901. [2019-11-16 00:40:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2019-11-16 00:40:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3136 transitions. [2019-11-16 00:40:07,115 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 3136 transitions. Word has length 89 [2019-11-16 00:40:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:07,115 INFO L462 AbstractCegarLoop]: Abstraction has 1901 states and 3136 transitions. [2019-11-16 00:40:07,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3136 transitions. [2019-11-16 00:40:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:40:07,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:07,118 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-16 00:40:07,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:07,322 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash -190608035, now seen corresponding path program 1 times [2019-11-16 00:40:07,322 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:07,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1428734664] [2019-11-16 00:40:07,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:07,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:07,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:07,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:07,714 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:07,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:07,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:07,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:07,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:07,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:07,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:07,752 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:07,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:07,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:07,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:07,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:07,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:07,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:07,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:07,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:07,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:07,842 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:07,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1428734664] [2019-11-16 00:40:07,876 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:07,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:07,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352945705] [2019-11-16 00:40:07,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:07,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:07,877 INFO L87 Difference]: Start difference. First operand 1901 states and 3136 transitions. Second operand 6 states. [2019-11-16 00:40:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:14,147 INFO L93 Difference]: Finished difference Result 4563 states and 7388 transitions. [2019-11-16 00:40:14,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:14,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-11-16 00:40:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:14,161 INFO L225 Difference]: With dead ends: 4563 [2019-11-16 00:40:14,161 INFO L226 Difference]: Without dead ends: 2670 [2019-11-16 00:40:14,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 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-11-16 00:40:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2019-11-16 00:40:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2159. [2019-11-16 00:40:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-11-16 00:40:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3574 transitions. [2019-11-16 00:40:14,228 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3574 transitions. Word has length 89 [2019-11-16 00:40:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:14,229 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 3574 transitions. [2019-11-16 00:40:14,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3574 transitions. [2019-11-16 00:40:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:40:14,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:14,232 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-16 00:40:14,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:14,444 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash -177439813, now seen corresponding path program 1 times [2019-11-16 00:40:14,444 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:14,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1816944139] [2019-11-16 00:40:14,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:14,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:14,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:14,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:14,824 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:14,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:14,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:14,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:14,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:14,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:14,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:14,851 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:14,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:14,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:14,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:14,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:14,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:14,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:14,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:14,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:14,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:14,895 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:14,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1816944139] [2019-11-16 00:40:14,939 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:14,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:14,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402978923] [2019-11-16 00:40:14,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:14,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:14,941 INFO L87 Difference]: Start difference. First operand 2159 states and 3574 transitions. Second operand 6 states. [2019-11-16 00:40:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:21,330 INFO L93 Difference]: Finished difference Result 4833 states and 7849 transitions. [2019-11-16 00:40:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:21,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-11-16 00:40:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:21,345 INFO L225 Difference]: With dead ends: 4833 [2019-11-16 00:40:21,346 INFO L226 Difference]: Without dead ends: 2668 [2019-11-16 00:40:21,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 173 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-11-16 00:40:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-11-16 00:40:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2171. [2019-11-16 00:40:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-11-16 00:40:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3592 transitions. [2019-11-16 00:40:21,411 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3592 transitions. Word has length 90 [2019-11-16 00:40:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:21,411 INFO L462 AbstractCegarLoop]: Abstraction has 2171 states and 3592 transitions. [2019-11-16 00:40:21,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3592 transitions. [2019-11-16 00:40:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:40:21,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:21,414 INFO L380 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] [2019-11-16 00:40:21,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:21,618 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1174626467, now seen corresponding path program 1 times [2019-11-16 00:40:21,619 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:21,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [343714097] [2019-11-16 00:40:21,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:22,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:22,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:22,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:22,169 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:22,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:22,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:22,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:22,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:22,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:22,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:22,190 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:22,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:22,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:22,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:22,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:22,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:22,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:22,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:22,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:22,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:22,217 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:22,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [343714097] [2019-11-16 00:40:22,253 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:22,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:22,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940500127] [2019-11-16 00:40:22,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:22,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:22,253 INFO L87 Difference]: Start difference. First operand 2171 states and 3592 transitions. Second operand 6 states. [2019-11-16 00:40:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:28,263 INFO L93 Difference]: Finished difference Result 4824 states and 7833 transitions. [2019-11-16 00:40:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:28,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-16 00:40:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:28,278 INFO L225 Difference]: With dead ends: 4824 [2019-11-16 00:40:28,278 INFO L226 Difference]: Without dead ends: 2661 [2019-11-16 00:40:28,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2019-11-16 00:40:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2171. [2019-11-16 00:40:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-11-16 00:40:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3551 transitions. [2019-11-16 00:40:28,344 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3551 transitions. Word has length 99 [2019-11-16 00:40:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:28,345 INFO L462 AbstractCegarLoop]: Abstraction has 2171 states and 3551 transitions. [2019-11-16 00:40:28,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3551 transitions. [2019-11-16 00:40:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:40:28,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:28,347 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:40:28,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:28,560 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1275331753, now seen corresponding path program 1 times [2019-11-16 00:40:28,561 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:28,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1350649632] [2019-11-16 00:40:28,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:28,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:28,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:28,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:28,973 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:28,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:28,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:28,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:28,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:28,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:29,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:29,001 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:29,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:29,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:29,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:29,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:29,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:29,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:29,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:29,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:29,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:29,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:29,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1350649632] [2019-11-16 00:40:29,069 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:29,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:29,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412733538] [2019-11-16 00:40:29,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:29,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:29,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:29,070 INFO L87 Difference]: Start difference. First operand 2171 states and 3551 transitions. Second operand 6 states. [2019-11-16 00:40:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:35,551 INFO L93 Difference]: Finished difference Result 5076 states and 8170 transitions. [2019-11-16 00:40:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:35,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-16 00:40:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:35,574 INFO L225 Difference]: With dead ends: 5076 [2019-11-16 00:40:35,575 INFO L226 Difference]: Without dead ends: 2913 [2019-11-16 00:40:35,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-11-16 00:40:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2351. [2019-11-16 00:40:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:40:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3828 transitions. [2019-11-16 00:40:35,647 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3828 transitions. Word has length 99 [2019-11-16 00:40:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:35,647 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3828 transitions. [2019-11-16 00:40:35,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3828 transitions. [2019-11-16 00:40:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:40:35,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:35,650 INFO L380 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] [2019-11-16 00:40:35,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:35,855 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:35,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:35,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1790280433, now seen corresponding path program 1 times [2019-11-16 00:40:35,856 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:35,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [715094898] [2019-11-16 00:40:35,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:36,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:36,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:36,348 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:36,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:36,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:36,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:36,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:36,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:36,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:36,382 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:36,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:36,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:36,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:36,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:36,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:36,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:36,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:36,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:36,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:36,417 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:36,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [715094898] [2019-11-16 00:40:36,447 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:36,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:36,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270131719] [2019-11-16 00:40:36,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:36,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:36,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:36,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:36,448 INFO L87 Difference]: Start difference. First operand 2351 states and 3828 transitions. Second operand 6 states. [2019-11-16 00:40:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:40,933 INFO L93 Difference]: Finished difference Result 5184 states and 8303 transitions. [2019-11-16 00:40:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:40,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-16 00:40:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:40,946 INFO L225 Difference]: With dead ends: 5184 [2019-11-16 00:40:40,946 INFO L226 Difference]: Without dead ends: 2841 [2019-11-16 00:40:40,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-11-16 00:40:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2351. [2019-11-16 00:40:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:40:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3781 transitions. [2019-11-16 00:40:41,016 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3781 transitions. Word has length 99 [2019-11-16 00:40:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:41,016 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3781 transitions. [2019-11-16 00:40:41,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3781 transitions. [2019-11-16 00:40:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:40:41,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:41,019 INFO L380 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] [2019-11-16 00:40:41,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:41,223 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -151554348, now seen corresponding path program 1 times [2019-11-16 00:40:41,223 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:41,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1683578201] [2019-11-16 00:40:41,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:41,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:41,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:41,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:41,740 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:41,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:41,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:41,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:41,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:41,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:41,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:41,771 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:41,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:41,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:41,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:41,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:41,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:41,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:41,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:41,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:41,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:41,815 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:41,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1683578201] [2019-11-16 00:40:41,852 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:41,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:41,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731501499] [2019-11-16 00:40:41,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:41,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:41,853 INFO L87 Difference]: Start difference. First operand 2351 states and 3781 transitions. Second operand 6 states. [2019-11-16 00:40:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:47,738 INFO L93 Difference]: Finished difference Result 5184 states and 8208 transitions. [2019-11-16 00:40:47,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:47,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-16 00:40:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:47,752 INFO L225 Difference]: With dead ends: 5184 [2019-11-16 00:40:47,753 INFO L226 Difference]: Without dead ends: 2841 [2019-11-16 00:40:47,755 INFO L600 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-11-16 00:40:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-11-16 00:40:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2351. [2019-11-16 00:40:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:40:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3734 transitions. [2019-11-16 00:40:47,820 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3734 transitions. Word has length 100 [2019-11-16 00:40:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:47,820 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3734 transitions. [2019-11-16 00:40:47,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3734 transitions. [2019-11-16 00:40:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:40:47,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:47,823 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:48,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:48,031 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash -337470246, now seen corresponding path program 1 times [2019-11-16 00:40:48,032 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:48,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [278324092] [2019-11-16 00:40:48,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:48,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:48,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:48,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,458 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:48,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:48,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,499 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:48,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:48,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:48,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:48,539 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:48,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278324092] [2019-11-16 00:40:48,594 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:48,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:48,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23367573] [2019-11-16 00:40:48,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:48,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:48,598 INFO L87 Difference]: Start difference. First operand 2351 states and 3734 transitions. Second operand 6 states. [2019-11-16 00:40:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:57,120 INFO L93 Difference]: Finished difference Result 5182 states and 8111 transitions. [2019-11-16 00:40:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:57,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-16 00:40:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:57,127 INFO L225 Difference]: With dead ends: 5182 [2019-11-16 00:40:57,127 INFO L226 Difference]: Without dead ends: 2839 [2019-11-16 00:40:57,130 INFO L600 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-11-16 00:40:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2019-11-16 00:40:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2351. [2019-11-16 00:40:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:40:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3699 transitions. [2019-11-16 00:40:57,186 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3699 transitions. Word has length 100 [2019-11-16 00:40:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:57,186 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3699 transitions. [2019-11-16 00:40:57,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3699 transitions. [2019-11-16 00:40:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:40:57,189 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:57,189 INFO L380 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] [2019-11-16 00:40:57,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:57,393 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2145724330, now seen corresponding path program 1 times [2019-11-16 00:40:57,394 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:57,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [772900925] [2019-11-16 00:40:57,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:57,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:57,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:57,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:57,930 INFO L375 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 23 treesize of output 19 [2019-11-16 00:40:57,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:57,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:57,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,952 INFO L375 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 31 treesize of output 24 [2019-11-16 00:40:57,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:57,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:40:57,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:57,977 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:58,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [772900925] [2019-11-16 00:40:58,023 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:58,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:58,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672801406] [2019-11-16 00:40:58,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:58,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:58,024 INFO L87 Difference]: Start difference. First operand 2351 states and 3699 transitions. Second operand 6 states. [2019-11-16 00:41:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:05,188 INFO L93 Difference]: Finished difference Result 5182 states and 8040 transitions. [2019-11-16 00:41:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:05,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-16 00:41:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:05,194 INFO L225 Difference]: With dead ends: 5182 [2019-11-16 00:41:05,194 INFO L226 Difference]: Without dead ends: 2839 [2019-11-16 00:41:05,197 INFO L600 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-11-16 00:41:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2019-11-16 00:41:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2351. [2019-11-16 00:41:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:41:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3652 transitions. [2019-11-16 00:41:05,247 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3652 transitions. Word has length 101 [2019-11-16 00:41:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:05,248 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3652 transitions. [2019-11-16 00:41:05,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3652 transitions. [2019-11-16 00:41:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:41:05,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:05,250 INFO L380 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] [2019-11-16 00:41:05,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:05,454 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1467318247, now seen corresponding path program 1 times [2019-11-16 00:41:05,455 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:05,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [525017596] [2019-11-16 00:41:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:05,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:05,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:05,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:05,940 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:05,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:05,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:05,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,962 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:05,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:05,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:05,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:41:05,985 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:41:06,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525017596] [2019-11-16 00:41:06,016 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:06,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:06,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792044150] [2019-11-16 00:41:06,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:06,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:06,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:06,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:06,017 INFO L87 Difference]: Start difference. First operand 2351 states and 3652 transitions. Second operand 6 states. [2019-11-16 00:41:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:14,576 INFO L93 Difference]: Finished difference Result 5112 states and 7854 transitions. [2019-11-16 00:41:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:14,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-16 00:41:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:14,582 INFO L225 Difference]: With dead ends: 5112 [2019-11-16 00:41:14,582 INFO L226 Difference]: Without dead ends: 2769 [2019-11-16 00:41:14,585 INFO L600 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-11-16 00:41:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-11-16 00:41:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2351. [2019-11-16 00:41:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:41:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3605 transitions. [2019-11-16 00:41:14,649 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3605 transitions. Word has length 102 [2019-11-16 00:41:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:14,650 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3605 transitions. [2019-11-16 00:41:14,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3605 transitions. [2019-11-16 00:41:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:41:14,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:14,652 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:41:14,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:14,857 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1969129503, now seen corresponding path program 1 times [2019-11-16 00:41:14,857 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:14,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1809811999] [2019-11-16 00:41:14,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:15,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:15,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:15,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:15,397 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:15,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:15,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:15,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,417 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:15,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:15,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:15,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:41:15,449 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:41:15,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809811999] [2019-11-16 00:41:15,482 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:15,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:15,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746350424] [2019-11-16 00:41:15,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:15,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:15,483 INFO L87 Difference]: Start difference. First operand 2351 states and 3605 transitions. Second operand 6 states. [2019-11-16 00:41:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:23,250 INFO L93 Difference]: Finished difference Result 5364 states and 8143 transitions. [2019-11-16 00:41:23,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:23,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-16 00:41:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:23,259 INFO L225 Difference]: With dead ends: 5364 [2019-11-16 00:41:23,259 INFO L226 Difference]: Without dead ends: 3021 [2019-11-16 00:41:23,262 INFO L600 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-11-16 00:41:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-11-16 00:41:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2519. [2019-11-16 00:41:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2519 states. [2019-11-16 00:41:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3828 transitions. [2019-11-16 00:41:23,334 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3828 transitions. Word has length 102 [2019-11-16 00:41:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:23,335 INFO L462 AbstractCegarLoop]: Abstraction has 2519 states and 3828 transitions. [2019-11-16 00:41:23,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3828 transitions. [2019-11-16 00:41:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:41:23,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:23,337 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:41:23,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:23,541 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1137381406, now seen corresponding path program 1 times [2019-11-16 00:41:23,541 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:23,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [273894615] [2019-11-16 00:41:23,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:24,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:24,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:24,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:24,084 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:24,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:24,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:24,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:24,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:24,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:24,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:24,130 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:24,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:24,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:24,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:24,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:24,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:24,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:24,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:24,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:24,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:41:24,166 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:41:24,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [273894615] [2019-11-16 00:41:24,228 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:24,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:24,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851666017] [2019-11-16 00:41:24,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:24,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:24,229 INFO L87 Difference]: Start difference. First operand 2519 states and 3828 transitions. Second operand 6 states. [2019-11-16 00:41:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:32,964 INFO L93 Difference]: Finished difference Result 5440 states and 8191 transitions. [2019-11-16 00:41:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:32,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-16 00:41:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:32,969 INFO L225 Difference]: With dead ends: 5440 [2019-11-16 00:41:32,970 INFO L226 Difference]: Without dead ends: 2929 [2019-11-16 00:41:32,973 INFO L600 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-11-16 00:41:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2019-11-16 00:41:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2519. [2019-11-16 00:41:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2519 states. [2019-11-16 00:41:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3787 transitions. [2019-11-16 00:41:33,047 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3787 transitions. Word has length 103 [2019-11-16 00:41:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:33,048 INFO L462 AbstractCegarLoop]: Abstraction has 2519 states and 3787 transitions. [2019-11-16 00:41:33,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3787 transitions. [2019-11-16 00:41:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:41:33,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:33,050 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:33,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:33,254 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1821597758, now seen corresponding path program 1 times [2019-11-16 00:41:33,255 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:33,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [53648569] [2019-11-16 00:41:33,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:33,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:33,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:33,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:33,714 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:33,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:33,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:33,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:33,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:33,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:33,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:33,736 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:33,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:33,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:33,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:33,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:33,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:33,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:33,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:33,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:33,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:41:33,772 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:41:33,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [53648569] [2019-11-16 00:41:33,807 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:33,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:33,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782695593] [2019-11-16 00:41:33,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:33,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:33,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:33,808 INFO L87 Difference]: Start difference. First operand 2519 states and 3787 transitions. Second operand 6 states. [2019-11-16 00:41:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:42,375 INFO L93 Difference]: Finished difference Result 5692 states and 8480 transitions. [2019-11-16 00:41:42,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:42,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-16 00:41:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:42,382 INFO L225 Difference]: With dead ends: 5692 [2019-11-16 00:41:42,382 INFO L226 Difference]: Without dead ends: 3181 [2019-11-16 00:41:42,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 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-11-16 00:41:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-11-16 00:41:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2729. [2019-11-16 00:41:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2019-11-16 00:41:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4081 transitions. [2019-11-16 00:41:42,466 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4081 transitions. Word has length 109 [2019-11-16 00:41:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:42,467 INFO L462 AbstractCegarLoop]: Abstraction has 2729 states and 4081 transitions. [2019-11-16 00:41:42,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4081 transitions. [2019-11-16 00:41:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:41:42,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:42,469 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:42,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:42,672 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -296364640, now seen corresponding path program 1 times [2019-11-16 00:41:42,673 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:42,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1845017279] [2019-11-16 00:41:42,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:43,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:43,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:43,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:43,078 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:43,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:43,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:43,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:43,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:43,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:43,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:43,100 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:43,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:43,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:43,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:43,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:43,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:43,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:43,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:43,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:43,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:41:43,148 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:41:43,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1845017279] [2019-11-16 00:41:43,195 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:43,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:43,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46528533] [2019-11-16 00:41:43,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:43,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:43,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:43,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:43,196 INFO L87 Difference]: Start difference. First operand 2729 states and 4081 transitions. Second operand 6 states. [2019-11-16 00:41:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:49,912 INFO L93 Difference]: Finished difference Result 5858 states and 8693 transitions. [2019-11-16 00:41:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:49,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-11-16 00:41:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:49,915 INFO L225 Difference]: With dead ends: 5858 [2019-11-16 00:41:49,915 INFO L226 Difference]: Without dead ends: 3137 [2019-11-16 00:41:49,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 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-11-16 00:41:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2019-11-16 00:41:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2729. [2019-11-16 00:41:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2019-11-16 00:41:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4057 transitions. [2019-11-16 00:41:50,036 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4057 transitions. Word has length 110 [2019-11-16 00:41:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:50,037 INFO L462 AbstractCegarLoop]: Abstraction has 2729 states and 4057 transitions. [2019-11-16 00:41:50,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4057 transitions. [2019-11-16 00:41:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-16 00:41:50,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:50,040 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:50,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:50,243 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1266941451, now seen corresponding path program 1 times [2019-11-16 00:41:50,244 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:50,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [739998814] [2019-11-16 00:41:50,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:51,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:51,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:51,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:51,016 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:51,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:51,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:51,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:51,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:51,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:51,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:51,037 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:51,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:51,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:51,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:51,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:51,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:51,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:51,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:51,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:51,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:51,081 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:51,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [739998814] [2019-11-16 00:41:51,137 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:51,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:51,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658551620] [2019-11-16 00:41:51,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:51,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:51,138 INFO L87 Difference]: Start difference. First operand 2729 states and 4057 transitions. Second operand 6 states. [2019-11-16 00:41:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:56,948 INFO L93 Difference]: Finished difference Result 6110 states and 9004 transitions. [2019-11-16 00:41:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:56,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-11-16 00:41:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:56,951 INFO L225 Difference]: With dead ends: 6110 [2019-11-16 00:41:56,951 INFO L226 Difference]: Without dead ends: 3389 [2019-11-16 00:41:56,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 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-11-16 00:41:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2019-11-16 00:41:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 2885. [2019-11-16 00:41:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2885 states. [2019-11-16 00:41:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4244 transitions. [2019-11-16 00:41:57,044 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4244 transitions. Word has length 130 [2019-11-16 00:41:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:57,045 INFO L462 AbstractCegarLoop]: Abstraction has 2885 states and 4244 transitions. [2019-11-16 00:41:57,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4244 transitions. [2019-11-16 00:41:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-16 00:41:57,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:57,048 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-16 00:41:57,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:57,257 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -315653806, now seen corresponding path program 1 times [2019-11-16 00:41:57,257 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:57,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [705564283] [2019-11-16 00:41:57,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:58,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:58,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:58,046 INFO L375 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 23 treesize of output 19 [2019-11-16 00:41:58,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:58,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:58,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:58,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:58,082 INFO L375 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 31 treesize of output 24 [2019-11-16 00:41:58,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:58,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:58,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:41:58,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:58,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:58,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:58,120 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:58,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [705564283] [2019-11-16 00:41:58,178 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:58,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:58,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634036206] [2019-11-16 00:41:58,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:58,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:58,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:58,179 INFO L87 Difference]: Start difference. First operand 2885 states and 4244 transitions. Second operand 6 states. [2019-11-16 00:42:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:04,247 INFO L93 Difference]: Finished difference Result 6168 states and 9014 transitions. [2019-11-16 00:42:04,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:04,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-16 00:42:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:04,250 INFO L225 Difference]: With dead ends: 6168 [2019-11-16 00:42:04,250 INFO L226 Difference]: Without dead ends: 3291 [2019-11-16 00:42:04,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 255 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-11-16 00:42:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2019-11-16 00:42:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 2885. [2019-11-16 00:42:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2885 states. [2019-11-16 00:42:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4191 transitions. [2019-11-16 00:42:04,315 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4191 transitions. Word has length 131 [2019-11-16 00:42:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:04,315 INFO L462 AbstractCegarLoop]: Abstraction has 2885 states and 4191 transitions. [2019-11-16 00:42:04,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4191 transitions. [2019-11-16 00:42:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-16 00:42:04,317 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:04,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:04,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:04,518 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash 242060838, now seen corresponding path program 1 times [2019-11-16 00:42:04,518 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:04,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1411388980] [2019-11-16 00:42:04,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:05,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:05,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:05,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:05,042 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:05,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:05,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:05,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:05,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:05,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:05,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:05,076 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:05,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:05,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:05,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:05,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:05,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:05,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:05,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:05,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:05,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:42:05,127 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:42:05,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1411388980] [2019-11-16 00:42:05,166 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:05,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:05,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101360018] [2019-11-16 00:42:05,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:05,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:05,167 INFO L87 Difference]: Start difference. First operand 2885 states and 4191 transitions. Second operand 6 states. [2019-11-16 00:42:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:13,040 INFO L93 Difference]: Finished difference Result 6427 states and 9262 transitions. [2019-11-16 00:42:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:13,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-11-16 00:42:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:13,044 INFO L225 Difference]: With dead ends: 6427 [2019-11-16 00:42:13,044 INFO L226 Difference]: Without dead ends: 3550 [2019-11-16 00:42:13,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 259 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-11-16 00:42:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2019-11-16 00:42:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3138. [2019-11-16 00:42:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-16 00:42:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4528 transitions. [2019-11-16 00:42:13,167 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4528 transitions. Word has length 133 [2019-11-16 00:42:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:13,167 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4528 transitions. [2019-11-16 00:42:13,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4528 transitions. [2019-11-16 00:42:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:42:13,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:13,169 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:13,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:13,373 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash -956871644, now seen corresponding path program 1 times [2019-11-16 00:42:13,373 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:13,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [416645909] [2019-11-16 00:42:13,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:13,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:13,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:13,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:13,885 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:13,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:13,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:13,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:13,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:13,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:13,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:13,907 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:13,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:13,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:13,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:13,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:13,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:13,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:13,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:13,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:13,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:42:13,955 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:42:14,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [416645909] [2019-11-16 00:42:14,002 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:14,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:14,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440219048] [2019-11-16 00:42:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:14,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:14,003 INFO L87 Difference]: Start difference. First operand 3138 states and 4528 transitions. Second operand 6 states. [2019-11-16 00:42:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:23,205 INFO L93 Difference]: Finished difference Result 6673 states and 9579 transitions. [2019-11-16 00:42:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:23,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-11-16 00:42:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:23,210 INFO L225 Difference]: With dead ends: 6673 [2019-11-16 00:42:23,210 INFO L226 Difference]: Without dead ends: 3487 [2019-11-16 00:42:23,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 261 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-11-16 00:42:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2019-11-16 00:42:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3085. [2019-11-16 00:42:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3085 states. [2019-11-16 00:42:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4439 transitions. [2019-11-16 00:42:23,294 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4439 transitions. Word has length 134 [2019-11-16 00:42:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:23,295 INFO L462 AbstractCegarLoop]: Abstraction has 3085 states and 4439 transitions. [2019-11-16 00:42:23,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4439 transitions. [2019-11-16 00:42:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:42:23,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:23,296 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-16 00:42:23,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:23,497 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -280251575, now seen corresponding path program 1 times [2019-11-16 00:42:23,498 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:23,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [196346946] [2019-11-16 00:42:23,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:23,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:23,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:23,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:23,985 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:23,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:23,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:23,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:23,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:24,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:24,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:24,005 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:24,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:24,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:24,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:24,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:24,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:24,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:24,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:24,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:24,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:42:24,057 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:42:24,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [196346946] [2019-11-16 00:42:24,146 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:24,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:24,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652475273] [2019-11-16 00:42:24,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:24,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:24,152 INFO L87 Difference]: Start difference. First operand 3085 states and 4439 transitions. Second operand 6 states. [2019-11-16 00:42:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:28,575 INFO L93 Difference]: Finished difference Result 6763 states and 9686 transitions. [2019-11-16 00:42:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:28,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-11-16 00:42:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:28,578 INFO L225 Difference]: With dead ends: 6763 [2019-11-16 00:42:28,578 INFO L226 Difference]: Without dead ends: 3686 [2019-11-16 00:42:28,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 275 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-11-16 00:42:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2019-11-16 00:42:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3283. [2019-11-16 00:42:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3283 states. [2019-11-16 00:42:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 3283 states and 4691 transitions. [2019-11-16 00:42:28,658 INFO L78 Accepts]: Start accepts. Automaton has 3283 states and 4691 transitions. Word has length 141 [2019-11-16 00:42:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:28,658 INFO L462 AbstractCegarLoop]: Abstraction has 3283 states and 4691 transitions. [2019-11-16 00:42:28,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3283 states and 4691 transitions. [2019-11-16 00:42:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-16 00:42:28,660 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:28,660 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-16 00:42:28,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:28,861 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:28,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:28,861 INFO L82 PathProgramCache]: Analyzing trace with hash -234940985, now seen corresponding path program 1 times [2019-11-16 00:42:28,861 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:28,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [258802594] [2019-11-16 00:42:28,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:29,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:29,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:29,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:29,340 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:29,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:29,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:29,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:29,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:29,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:29,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:29,363 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:29,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:29,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:29,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:29,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:29,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:29,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:29,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:29,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:29,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:42:29,397 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:42:29,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [258802594] [2019-11-16 00:42:29,435 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:29,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:29,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299842706] [2019-11-16 00:42:29,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:29,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:29,436 INFO L87 Difference]: Start difference. First operand 3283 states and 4691 transitions. Second operand 6 states. [2019-11-16 00:42:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:34,210 INFO L93 Difference]: Finished difference Result 6951 states and 9890 transitions. [2019-11-16 00:42:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:34,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-11-16 00:42:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:34,217 INFO L225 Difference]: With dead ends: 6951 [2019-11-16 00:42:34,217 INFO L226 Difference]: Without dead ends: 3613 [2019-11-16 00:42:34,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 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-11-16 00:42:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2019-11-16 00:42:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3220. [2019-11-16 00:42:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2019-11-16 00:42:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4562 transitions. [2019-11-16 00:42:34,301 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4562 transitions. Word has length 142 [2019-11-16 00:42:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:34,301 INFO L462 AbstractCegarLoop]: Abstraction has 3220 states and 4562 transitions. [2019-11-16 00:42:34,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4562 transitions. [2019-11-16 00:42:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:42:34,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:34,303 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-16 00:42:34,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:34,506 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1489284318, now seen corresponding path program 1 times [2019-11-16 00:42:34,507 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:34,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1495121746] [2019-11-16 00:42:34,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:35,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:35,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:35,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:35,544 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:35,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:35,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:35,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:35,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:35,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:35,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:35,581 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:35,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:35,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:35,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:35,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:35,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:35,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:35,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:35,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:35,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:35,633 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:35,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1495121746] [2019-11-16 00:42:35,688 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:35,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:35,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262520720] [2019-11-16 00:42:35,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:35,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:35,690 INFO L87 Difference]: Start difference. First operand 3220 states and 4562 transitions. Second operand 6 states. [2019-11-16 00:42:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:42,180 INFO L93 Difference]: Finished difference Result 6966 states and 9844 transitions. [2019-11-16 00:42:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:42,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-11-16 00:42:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:42,184 INFO L225 Difference]: With dead ends: 6966 [2019-11-16 00:42:42,184 INFO L226 Difference]: Without dead ends: 3754 [2019-11-16 00:42:42,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 297 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-11-16 00:42:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-11-16 00:42:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3364. [2019-11-16 00:42:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2019-11-16 00:42:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4707 transitions. [2019-11-16 00:42:42,269 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4707 transitions. Word has length 152 [2019-11-16 00:42:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:42,270 INFO L462 AbstractCegarLoop]: Abstraction has 3364 states and 4707 transitions. [2019-11-16 00:42:42,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4707 transitions. [2019-11-16 00:42:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-16 00:42:42,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:42,272 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-16 00:42:42,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:42,475 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash 749481243, now seen corresponding path program 1 times [2019-11-16 00:42:42,476 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:42,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1136712860] [2019-11-16 00:42:42,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:43,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:43,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:43,503 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:43,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:43,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:43,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:43,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:43,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:43,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:43,526 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:43,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:43,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:43,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:43,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:43,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:43,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:43,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:43,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:43,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:43,561 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:43,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136712860] [2019-11-16 00:42:43,640 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:43,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:43,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272152951] [2019-11-16 00:42:43,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:43,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:43,642 INFO L87 Difference]: Start difference. First operand 3364 states and 4707 transitions. Second operand 6 states. [2019-11-16 00:42:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:49,661 INFO L93 Difference]: Finished difference Result 7100 states and 9906 transitions. [2019-11-16 00:42:49,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:49,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-11-16 00:42:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:49,667 INFO L225 Difference]: With dead ends: 7100 [2019-11-16 00:42:49,667 INFO L226 Difference]: Without dead ends: 3730 [2019-11-16 00:42:49,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 299 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-11-16 00:42:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2019-11-16 00:42:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3350. [2019-11-16 00:42:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2019-11-16 00:42:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4616 transitions. [2019-11-16 00:42:49,797 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4616 transitions. Word has length 153 [2019-11-16 00:42:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:49,797 INFO L462 AbstractCegarLoop]: Abstraction has 3350 states and 4616 transitions. [2019-11-16 00:42:49,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4616 transitions. [2019-11-16 00:42:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:42:49,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:49,799 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:50,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:50,000 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1457204437, now seen corresponding path program 1 times [2019-11-16 00:42:50,001 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:50,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [876066883] [2019-11-16 00:42:50,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:50,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:50,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:50,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:50,672 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:50,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:50,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:50,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,695 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:50,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:50,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:50,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:50,733 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:50,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [876066883] [2019-11-16 00:42:50,771 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:50,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:50,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53854425] [2019-11-16 00:42:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:50,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:50,772 INFO L87 Difference]: Start difference. First operand 3350 states and 4616 transitions. Second operand 6 states. [2019-11-16 00:42:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:55,836 INFO L93 Difference]: Finished difference Result 7185 states and 9886 transitions. [2019-11-16 00:42:55,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:55,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-11-16 00:42:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:55,841 INFO L225 Difference]: With dead ends: 7185 [2019-11-16 00:42:55,841 INFO L226 Difference]: Without dead ends: 3843 [2019-11-16 00:42:55,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 303 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-11-16 00:42:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2019-11-16 00:42:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3460. [2019-11-16 00:42:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2019-11-16 00:42:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4699 transitions. [2019-11-16 00:42:55,936 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4699 transitions. Word has length 155 [2019-11-16 00:42:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:55,936 INFO L462 AbstractCegarLoop]: Abstraction has 3460 states and 4699 transitions. [2019-11-16 00:42:55,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4699 transitions. [2019-11-16 00:42:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:42:55,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:55,940 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:56,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:56,141 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1829002542, now seen corresponding path program 1 times [2019-11-16 00:42:56,142 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:56,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [189561851] [2019-11-16 00:42:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:56,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:56,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:56,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:56,812 INFO L375 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 23 treesize of output 19 [2019-11-16 00:42:56,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:56,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:56,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:56,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:56,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:56,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:56,849 INFO L375 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 31 treesize of output 24 [2019-11-16 00:42:56,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:56,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:56,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:56,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:56,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:42:56,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:56,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:56,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:56,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:56,893 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:56,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [189561851] [2019-11-16 00:42:56,957 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:56,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:56,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934935736] [2019-11-16 00:42:56,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:56,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:56,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:56,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:56,959 INFO L87 Difference]: Start difference. First operand 3460 states and 4699 transitions. Second operand 6 states. [2019-11-16 00:43:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:02,415 INFO L93 Difference]: Finished difference Result 6688 states and 9079 transitions. [2019-11-16 00:43:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:43:02,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-11-16 00:43:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:02,420 INFO L225 Difference]: With dead ends: 6688 [2019-11-16 00:43:02,420 INFO L226 Difference]: Without dead ends: 3222 [2019-11-16 00:43:02,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 305 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-11-16 00:43:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2019-11-16 00:43:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2907. [2019-11-16 00:43:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2019-11-16 00:43:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3889 transitions. [2019-11-16 00:43:02,501 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3889 transitions. Word has length 156 [2019-11-16 00:43:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:02,502 INFO L462 AbstractCegarLoop]: Abstraction has 2907 states and 3889 transitions. [2019-11-16 00:43:02,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:43:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3889 transitions. [2019-11-16 00:43:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-16 00:43:02,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:02,504 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:02,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:02,706 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1485969295, now seen corresponding path program 1 times [2019-11-16 00:43:02,706 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:02,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1275495013] [2019-11-16 00:43:02,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:02,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:43:02,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:43:02,980 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:43:02,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275495013] [2019-11-16 00:43:02,998 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:02,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:43:02,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914018780] [2019-11-16 00:43:02,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:43:02,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:43:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:02,999 INFO L87 Difference]: Start difference. First operand 2907 states and 3889 transitions. Second operand 3 states. [2019-11-16 00:43:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:04,696 INFO L93 Difference]: Finished difference Result 6331 states and 8474 transitions. [2019-11-16 00:43:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:43:04,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-11-16 00:43:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:04,699 INFO L225 Difference]: With dead ends: 6331 [2019-11-16 00:43:04,699 INFO L226 Difference]: Without dead ends: 3456 [2019-11-16 00:43:04,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2019-11-16 00:43:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3454. [2019-11-16 00:43:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2019-11-16 00:43:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4617 transitions. [2019-11-16 00:43:04,793 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4617 transitions. Word has length 169 [2019-11-16 00:43:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:04,793 INFO L462 AbstractCegarLoop]: Abstraction has 3454 states and 4617 transitions. [2019-11-16 00:43:04,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:43:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4617 transitions. [2019-11-16 00:43:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:43:04,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:04,795 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:04,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:04,996 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1946569725, now seen corresponding path program 1 times [2019-11-16 00:43:04,996 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:04,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1953683633] [2019-11-16 00:43:04,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:05,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:43:05,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:43:05,228 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:43:05,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1953683633] [2019-11-16 00:43:05,253 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:05,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:43:05,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798510112] [2019-11-16 00:43:05,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:43:05,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:43:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:05,256 INFO L87 Difference]: Start difference. First operand 3454 states and 4617 transitions. Second operand 3 states. [2019-11-16 00:43:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:06,484 INFO L93 Difference]: Finished difference Result 7416 states and 9922 transitions. [2019-11-16 00:43:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:43:06,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-16 00:43:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:06,487 INFO L225 Difference]: With dead ends: 7416 [2019-11-16 00:43:06,487 INFO L226 Difference]: Without dead ends: 3994 [2019-11-16 00:43:06,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-11-16 00:43:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3970. [2019-11-16 00:43:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3970 states. [2019-11-16 00:43:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 5316 transitions. [2019-11-16 00:43:06,592 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 5316 transitions. Word has length 170 [2019-11-16 00:43:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:06,592 INFO L462 AbstractCegarLoop]: Abstraction has 3970 states and 5316 transitions. [2019-11-16 00:43:06,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:43:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 5316 transitions. [2019-11-16 00:43:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:43:06,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:06,595 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:06,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:06,795 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1401697151, now seen corresponding path program 1 times [2019-11-16 00:43:06,796 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:06,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1329900275] [2019-11-16 00:43:06,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:06,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:43:06,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:43:07,015 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:43:07,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1329900275] [2019-11-16 00:43:07,030 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:07,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:43:07,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620275679] [2019-11-16 00:43:07,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:43:07,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:43:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:07,031 INFO L87 Difference]: Start difference. First operand 3970 states and 5316 transitions. Second operand 3 states. [2019-11-16 00:43:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:08,352 INFO L93 Difference]: Finished difference Result 7957 states and 10657 transitions. [2019-11-16 00:43:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:43:08,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-16 00:43:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:08,355 INFO L225 Difference]: With dead ends: 7957 [2019-11-16 00:43:08,355 INFO L226 Difference]: Without dead ends: 4019 [2019-11-16 00:43:08,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:43:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2019-11-16 00:43:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2019-11-16 00:43:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4019 states. [2019-11-16 00:43:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5382 transitions. [2019-11-16 00:43:08,465 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5382 transitions. Word has length 170 [2019-11-16 00:43:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:08,465 INFO L462 AbstractCegarLoop]: Abstraction has 4019 states and 5382 transitions. [2019-11-16 00:43:08,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:43:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5382 transitions. [2019-11-16 00:43:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-16 00:43:08,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:08,467 INFO L380 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] [2019-11-16 00:43:08,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:08,668 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2019-11-16 00:43:08,669 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:08,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [338014884] [2019-11-16 00:43:08,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f2634f-8016-460a-a77d-f872e5a1a2a9/bin/uautomizer/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:12,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-16 00:43:12,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:12,978 INFO L375 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-11-16 00:43:12,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:15,102 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:43:15,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:15,105 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_375|, |v_#memory_$Pointer$.base_375|], 2=[|v_#memory_$Pointer$.offset_368|, |v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_369|, |v_#memory_$Pointer$.base_368|]} [2019-11-16 00:43:15,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:15,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:15,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:15,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:15,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:15,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:15,675 INFO L235 Elim1Store]: Index analysis took 439 ms [2019-11-16 00:43:16,083 INFO L375 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-11-16 00:43:16,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:17,183 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:43:17,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:17,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,459 INFO L235 Elim1Store]: Index analysis took 228 ms [2019-11-16 00:43:17,654 INFO L375 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-11-16 00:43:17,655 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:18,352 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:43:18,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:18,362 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:18,725 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:43:18,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:18,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 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-11-16 00:43:18,800 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:18,971 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-16 00:43:18,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:18,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:18,997 INFO L375 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-11-16 00:43:18,997 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,088 INFO L375 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-11-16 00:43:19,088 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,122 INFO L496 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-11-16 00:43:19,122 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-16 00:43:19,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:43:19,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:43:19,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:43:19,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:43:19,212 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,318 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-16 00:43:19,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,323 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-16 00:43:19,392 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-16 00:43:19,431 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,446 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:43:19,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:43:19,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:43:19,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:43:19,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:43:19,534 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-16 00:43:19,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,696 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,721 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,731 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:43:19,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-16 00:43:19,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-16 00:43:19,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-16 00:43:19,770 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-16 00:43:19,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,927 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:19,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:19,957 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,972 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:43:19,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 80 [2019-11-16 00:43:19,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-11-16 00:43:20,005 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-16 00:43:20,023 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_448|], 2=[|v_#memory_$Pointer$.offset_373|, |v_#memory_$Pointer$.offset_385|, |v_#memory_$Pointer$.base_385|, |v_#memory_$Pointer$.base_373|], 6=[|v_#memory_$Pointer$.offset_374|, |v_#memory_$Pointer$.base_374|]} [2019-11-16 00:43:20,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,344 INFO L235 Elim1Store]: Index analysis took 114 ms [2019-11-16 00:43:20,346 INFO L375 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-11-16 00:43:20,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,299 WARN L191 SmtUtils]: Spent 952.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:43:21,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,313 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:22,030 WARN L191 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:43:22,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:22,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:22,210 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:22,684 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:43:22,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:22,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:43:22,755 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:22,972 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:43:22,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,979 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:23,184 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:43:23,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:23,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 109 [2019-11-16 00:43:23,190 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:23,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:23,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:23,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 62 [2019-11-16 00:43:23,269 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,296 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:306, output treesize:62 [2019-11-16 00:43:23,324 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_386|, |v_#memory_$Pointer$.base_386|], 12=[|v_#memory_int_449|]} [2019-11-16 00:43:23,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2019-11-16 00:43:23,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2019-11-16 00:43:23,352 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:23,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:23,375 INFO L375 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 43 treesize of output 35 [2019-11-16 00:43:23,375 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:23,387 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:33 [2019-11-16 00:43:23,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:43:23,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:3 [2019-11-16 00:43:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:43:23,701 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:23,766 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_373|, |v_#memory_$Pointer$.base_388|, |v_#memory_$Pointer$.offset_388|, |v_#memory_$Pointer$.base_373|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_374|, |v_#memory_$Pointer$.base_374|]} [2019-11-16 00:43:23,814 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:25,185 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-16 00:43:25,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:25,211 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:26,019 WARN L191 SmtUtils]: Spent 808.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:43:26,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:26,029 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:26,250 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-16 00:43:26,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:26,256 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:26,404 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:43:26,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:26,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1748 treesize of output 1412 [2019-11-16 00:43:26,413 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:26,972 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-16 00:43:26,972 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 22.4 percent of original size [2019-11-16 00:43:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:26,985 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,103 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-16 00:43:27,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,113 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,246 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:43:27,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,251 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:309, output treesize:500 [2019-11-16 00:43:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:27,342 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,373 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,395 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:27,423 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:29,251 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 120 DAG size of output: 119 [2019-11-16 00:43:29,252 INFO L567 ElimStorePlain]: treesize reduction 245, result has 88.3 percent of original size [2019-11-16 00:43:29,275 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:29,361 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:29,377 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:29,392 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:35,097 WARN L191 SmtUtils]: Spent 5.70 s on a formula simplification that was a NOOP. DAG size: 136 [2019-11-16 00:43:35,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 4 xjuncts. [2019-11-16 00:43:35,099 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:1227, output treesize:2625 [2019-11-16 00:43:43,311 WARN L191 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 154 DAG size of output: 45 [2019-11-16 00:43:43,332 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_372|, |v_#memory_$Pointer$.offset_372|], 6=[|v_#memory_$Pointer$.offset_390|], 14=[|v_#memory_$Pointer$.base_390|]} [2019-11-16 00:43:43,359 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:43,610 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:43:43,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:43,619 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:43,765 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:43:43,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:43,768 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:43,888 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-16 00:43:43,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:43,890 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:43,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:43,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:43,931 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:393, output treesize:792 [2019-11-16 00:43:48,107 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_391|], 14=[|v_#memory_$Pointer$.base_391|]} [2019-11-16 00:43:48,116 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:48,223 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:43:48,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:48,224 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:48,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:48,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:48,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:413, output treesize:1432 [2019-11-16 00:43:54,420 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_371|, |v_#memory_$Pointer$.offset_371|], 19=[|v_#memory_$Pointer$.offset_392|], 31=[|v_#memory_$Pointer$.base_392|]} [2019-11-16 00:43:54,672 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:55,564 WARN L191 SmtUtils]: Spent 891.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-16 00:43:55,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:55,587 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:55,906 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-16 00:43:55,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:55,910 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:56,341 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:43:56,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:56,343 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:56,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:56,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:56,396 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:1513, output treesize:3832 [2019-11-16 00:44:06,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:44:06,870 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:44:06,873 INFO L168 Benchmark]: Toolchain (without parser) took 303774.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 940.2 MB in the beginning and 944.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 322.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:06,874 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:06,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1056.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:06,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.51 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:06,875 INFO L168 Benchmark]: Boogie Preprocessor took 114.45 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:06,875 INFO L168 Benchmark]: RCFGBuilder took 4477.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:06,875 INFO L168 Benchmark]: TraceAbstraction took 298034.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.2 MB). Free memory was 1.0 GB in the beginning and 944.1 MB in the end (delta: 78.8 MB). Peak memory consumption was 245.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:06,877 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1056.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.51 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.45 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4477.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 298034.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 166.2 MB). Free memory was 1.0 GB in the beginning and 944.1 MB in the end (delta: 78.8 MB). Peak memory consumption was 245.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...