./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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 e017d7bcecd9326dc3a012dec9b0fc34b9541a8f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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 e017d7bcecd9326dc3a012dec9b0fc34b9541a8f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-15 20:42:41,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:42:41,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:42:41,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:42:41,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:42:41,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:42:41,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:42:41,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:42:41,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:42:41,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:42:41,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:42:41,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:42:41,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:42:41,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:42:41,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:42:41,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:42:41,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:42:41,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:42:41,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:42:41,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:42:41,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:42:41,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:42:41,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:42:41,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:42:41,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:42:41,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:42:41,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:42:41,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:42:41,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:42:41,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:42:41,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:42:41,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:42:41,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:42:41,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:42:41,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:42:41,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:42:41,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:42:41,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:42:41,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:42:41,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:42:41,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:42:41,354 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:42:41,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:42:41,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:42:41,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:42:41,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:42:41,369 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:42:41,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:42:41,369 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:42:41,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:42:41,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:42:41,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:42:41,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:42:41,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:42:41,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:42:41,371 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:42:41,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:42:41,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:42:41,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:42:41,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:42:41,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:42:41,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:42:41,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:42:41,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:42:41,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:42:41,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:42:41,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:42:41,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:42:41,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:42:41,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:42:41,374 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_371502cb-8205-42ed-96db-e69a8f07c2c0/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 -> e017d7bcecd9326dc3a012dec9b0fc34b9541a8f [2019-11-15 20:42:41,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:42:41,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:42:41,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:42:41,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:42:41,424 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:42:41,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c [2019-11-15 20:42:41,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/33fad2526/d98afd45cdee4a4e899ff52777289fcb/FLAG15b50775b [2019-11-15 20:42:42,031 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:42:42,032 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c [2019-11-15 20:42:42,056 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/33fad2526/d98afd45cdee4a4e899ff52777289fcb/FLAG15b50775b [2019-11-15 20:42:42,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/33fad2526/d98afd45cdee4a4e899ff52777289fcb [2019-11-15 20:42:42,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:42:42,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:42:42,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:42:42,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:42:42,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:42:42,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:42:42" (1/1) ... [2019-11-15 20:42:42,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ade499c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:42, skipping insertion in model container [2019-11-15 20:42:42,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:42:42" (1/1) ... [2019-11-15 20:42:42,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:42:42,400 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:42:42,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:42:42,960 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:42:43,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:42:43,153 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:42:43,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43 WrapperNode [2019-11-15 20:42:43,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:42:43,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:42:43,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:42:43,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:42:43,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:42:43,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:42:43,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:42:43,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:42:43,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... [2019-11-15 20:42:43,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:42:43,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:42:43,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:42:43,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:42:43,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:42:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:42:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:42:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:42:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:42:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:42:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:42:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:42:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:42:43,765 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:42:44,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 20:42:44,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 20:42:44,625 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:42:44,625 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:42:44,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:44 BoogieIcfgContainer [2019-11-15 20:42:44,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:42:44,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:42:44,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:42:44,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:42:44,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:42:42" (1/3) ... [2019-11-15 20:42:44,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1461e200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:42:44, skipping insertion in model container [2019-11-15 20:42:44,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:43" (2/3) ... [2019-11-15 20:42:44,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1461e200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:42:44, skipping insertion in model container [2019-11-15 20:42:44,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:44" (3/3) ... [2019-11-15 20:42:44,633 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2019-11-15 20:42:44,642 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:42:44,649 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:42:44,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:42:44,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:42:44,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:42:44,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:42:44,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:42:44,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:42:44,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:42:44,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:42:44,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:42:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 20:42:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:42:44,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:44,712 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:44,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:44,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-15 20:42:44,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:44,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216064599] [2019-11-15 20:42:44,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:44,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:44,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:42:45,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216064599] [2019-11-15 20:42:45,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:45,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:45,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638600648] [2019-11-15 20:42:45,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:45,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:45,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:45,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:45,052 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 20:42:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:45,501 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-15 20:42:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:45,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 20:42:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:45,521 INFO L225 Difference]: With dead ends: 255 [2019-11-15 20:42:45,521 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 20:42:45,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 20:42:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-15 20:42:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 20:42:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-15 20:42:45,586 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-15 20:42:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:45,587 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-15 20:42:45,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-15 20:42:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 20:42:45,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:45,589 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] [2019-11-15 20:42:45,589 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-15 20:42:45,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:45,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544452844] [2019-11-15 20:42:45,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:45,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:45,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:42:45,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544452844] [2019-11-15 20:42:45,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:45,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:45,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458568870] [2019-11-15 20:42:45,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:45,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:45,786 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-15 20:42:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:45,829 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-15 20:42:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:45,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-15 20:42:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:45,832 INFO L225 Difference]: With dead ends: 321 [2019-11-15 20:42:45,833 INFO L226 Difference]: Without dead ends: 216 [2019-11-15 20:42:45,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-15 20:42:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-15 20:42:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-15 20:42:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-15 20:42:45,855 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-15 20:42:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:45,855 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-15 20:42:45,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-15 20:42:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:42:45,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:45,859 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:42:45,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:45,859 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-15 20:42:45,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:45,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373581583] [2019-11-15 20:42:45,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:45,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:45,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:42:46,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373581583] [2019-11-15 20:42:46,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:46,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:46,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024891409] [2019-11-15 20:42:46,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:46,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:46,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:46,044 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-15 20:42:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:46,157 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2019-11-15 20:42:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:46,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 20:42:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:46,169 INFO L225 Difference]: With dead ends: 421 [2019-11-15 20:42:46,169 INFO L226 Difference]: Without dead ends: 316 [2019-11-15 20:42:46,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-15 20:42:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-11-15 20:42:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-15 20:42:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2019-11-15 20:42:46,223 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2019-11-15 20:42:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:46,224 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2019-11-15 20:42:46,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2019-11-15 20:42:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 20:42:46,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:46,236 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:46,236 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:46,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:46,237 INFO L82 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2019-11-15 20:42:46,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:46,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766950261] [2019-11-15 20:42:46,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:46,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:46,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:46,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766950261] [2019-11-15 20:42:46,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:46,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:46,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925043902] [2019-11-15 20:42:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:46,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:46,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:46,429 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand 4 states. [2019-11-15 20:42:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:47,067 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2019-11-15 20:42:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:47,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-15 20:42:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:47,072 INFO L225 Difference]: With dead ends: 808 [2019-11-15 20:42:47,072 INFO L226 Difference]: Without dead ends: 502 [2019-11-15 20:42:47,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-15 20:42:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 366. [2019-11-15 20:42:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-15 20:42:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 553 transitions. [2019-11-15 20:42:47,098 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 553 transitions. Word has length 71 [2019-11-15 20:42:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:47,099 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 553 transitions. [2019-11-15 20:42:47,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 553 transitions. [2019-11-15 20:42:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 20:42:47,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:47,102 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:47,102 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1105291701, now seen corresponding path program 1 times [2019-11-15 20:42:47,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:47,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602098434] [2019-11-15 20:42:47,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:47,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:47,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:47,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602098434] [2019-11-15 20:42:47,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:47,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:47,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876604024] [2019-11-15 20:42:47,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:47,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:47,210 INFO L87 Difference]: Start difference. First operand 366 states and 553 transitions. Second operand 4 states. [2019-11-15 20:42:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:47,680 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2019-11-15 20:42:47,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:47,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-15 20:42:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:47,684 INFO L225 Difference]: With dead ends: 808 [2019-11-15 20:42:47,684 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 20:42:47,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 20:42:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2019-11-15 20:42:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-15 20:42:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 621 transitions. [2019-11-15 20:42:47,702 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 621 transitions. Word has length 71 [2019-11-15 20:42:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:47,702 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 621 transitions. [2019-11-15 20:42:47,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2019-11-15 20:42:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:42:47,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:47,706 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:47,706 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2019-11-15 20:42:47,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:47,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295093036] [2019-11-15 20:42:47,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:47,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:47,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:47,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295093036] [2019-11-15 20:42:47,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:47,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:47,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437686378] [2019-11-15 20:42:47,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:47,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:47,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:47,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:47,803 INFO L87 Difference]: Start difference. First operand 406 states and 621 transitions. Second operand 4 states. [2019-11-15 20:42:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:48,357 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2019-11-15 20:42:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:48,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 20:42:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:48,369 INFO L225 Difference]: With dead ends: 930 [2019-11-15 20:42:48,370 INFO L226 Difference]: Without dead ends: 534 [2019-11-15 20:42:48,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-15 20:42:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 408. [2019-11-15 20:42:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-11-15 20:42:48,392 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 72 [2019-11-15 20:42:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:48,402 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-11-15 20:42:48,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-11-15 20:42:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 20:42:48,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:48,407 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-15 20:42:48,407 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -200583067, now seen corresponding path program 2 times [2019-11-15 20:42:48,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:48,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574963873] [2019-11-15 20:42:48,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:48,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:48,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:48,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574963873] [2019-11-15 20:42:48,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:48,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:48,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728343176] [2019-11-15 20:42:48,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:48,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:48,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:48,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:48,527 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-11-15 20:42:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:49,145 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2019-11-15 20:42:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:49,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 20:42:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:49,149 INFO L225 Difference]: With dead ends: 930 [2019-11-15 20:42:49,149 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 20:42:49,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 20:42:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-15 20:42:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 621 transitions. [2019-11-15 20:42:49,166 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 621 transitions. Word has length 85 [2019-11-15 20:42:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:49,166 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 621 transitions. [2019-11-15 20:42:49,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 621 transitions. [2019-11-15 20:42:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 20:42:49,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:49,168 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-11-15 20:42:49,168 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1309563513, now seen corresponding path program 1 times [2019-11-15 20:42:49,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:49,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593857687] [2019-11-15 20:42:49,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:49,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:49,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:49,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593857687] [2019-11-15 20:42:49,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:49,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:49,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209100044] [2019-11-15 20:42:49,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:49,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:49,244 INFO L87 Difference]: Start difference. First operand 408 states and 621 transitions. Second operand 4 states. [2019-11-15 20:42:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:49,761 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2019-11-15 20:42:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:49,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 20:42:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:49,771 INFO L225 Difference]: With dead ends: 930 [2019-11-15 20:42:49,772 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 20:42:49,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 20:42:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-15 20:42:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 619 transitions. [2019-11-15 20:42:49,789 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 619 transitions. Word has length 85 [2019-11-15 20:42:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 619 transitions. [2019-11-15 20:42:49,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 619 transitions. [2019-11-15 20:42:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 20:42:49,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:49,794 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-15 20:42:49,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1229942365, now seen corresponding path program 2 times [2019-11-15 20:42:49,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:49,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223075839] [2019-11-15 20:42:49,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:49,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:49,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:49,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223075839] [2019-11-15 20:42:49,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:49,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:49,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372716247] [2019-11-15 20:42:49,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:49,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:49,901 INFO L87 Difference]: Start difference. First operand 408 states and 619 transitions. Second operand 4 states. [2019-11-15 20:42:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:50,350 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2019-11-15 20:42:50,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:50,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 20:42:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:50,354 INFO L225 Difference]: With dead ends: 850 [2019-11-15 20:42:50,355 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 20:42:50,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 20:42:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-15 20:42:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 617 transitions. [2019-11-15 20:42:50,375 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 617 transitions. Word has length 85 [2019-11-15 20:42:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:50,375 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 617 transitions. [2019-11-15 20:42:50,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 617 transitions. [2019-11-15 20:42:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 20:42:50,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:50,381 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-11-15 20:42:50,381 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044485, now seen corresponding path program 1 times [2019-11-15 20:42:50,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:50,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051715891] [2019-11-15 20:42:50,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:50,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:50,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:50,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051715891] [2019-11-15 20:42:50,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:50,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:50,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053774529] [2019-11-15 20:42:50,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:50,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:50,470 INFO L87 Difference]: Start difference. First operand 408 states and 617 transitions. Second operand 4 states. [2019-11-15 20:42:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:50,844 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2019-11-15 20:42:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:50,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 20:42:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:50,848 INFO L225 Difference]: With dead ends: 850 [2019-11-15 20:42:50,848 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 20:42:50,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 20:42:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-15 20:42:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 615 transitions. [2019-11-15 20:42:50,863 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 615 transitions. Word has length 85 [2019-11-15 20:42:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:50,864 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 615 transitions. [2019-11-15 20:42:50,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 615 transitions. [2019-11-15 20:42:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 20:42:50,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:50,866 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 20:42:50,866 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1887370232, now seen corresponding path program 1 times [2019-11-15 20:42:50,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:50,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126700113] [2019-11-15 20:42:50,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:50,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:50,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:50,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126700113] [2019-11-15 20:42:50,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:50,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:50,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637622639] [2019-11-15 20:42:50,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:50,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:50,951 INFO L87 Difference]: Start difference. First operand 408 states and 615 transitions. Second operand 4 states. [2019-11-15 20:42:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:51,549 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2019-11-15 20:42:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:51,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 20:42:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:51,554 INFO L225 Difference]: With dead ends: 930 [2019-11-15 20:42:51,554 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 20:42:51,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 20:42:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-15 20:42:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2019-11-15 20:42:51,568 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 86 [2019-11-15 20:42:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:51,569 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2019-11-15 20:42:51,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2019-11-15 20:42:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 20:42:51,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:51,571 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:51,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1587309149, now seen corresponding path program 1 times [2019-11-15 20:42:51,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:51,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390584658] [2019-11-15 20:42:51,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:51,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:51,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:51,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390584658] [2019-11-15 20:42:51,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:51,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:51,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15042445] [2019-11-15 20:42:51,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:51,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:51,652 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand 4 states. [2019-11-15 20:42:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:52,171 INFO L93 Difference]: Finished difference Result 785 states and 1170 transitions. [2019-11-15 20:42:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:52,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 20:42:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:52,177 INFO L225 Difference]: With dead ends: 785 [2019-11-15 20:42:52,178 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 20:42:52,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 20:42:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-15 20:42:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 611 transitions. [2019-11-15 20:42:52,192 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 611 transitions. Word has length 86 [2019-11-15 20:42:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 611 transitions. [2019-11-15 20:42:52,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 611 transitions. [2019-11-15 20:42:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 20:42:52,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:52,194 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 20:42:52,194 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 562229898, now seen corresponding path program 1 times [2019-11-15 20:42:52,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:52,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34625962] [2019-11-15 20:42:52,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:52,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:52,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34625962] [2019-11-15 20:42:52,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:52,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:52,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859349104] [2019-11-15 20:42:52,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:52,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:52,280 INFO L87 Difference]: Start difference. First operand 408 states and 611 transitions. Second operand 4 states. [2019-11-15 20:42:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:52,650 INFO L93 Difference]: Finished difference Result 850 states and 1264 transitions. [2019-11-15 20:42:52,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:52,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 20:42:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:52,653 INFO L225 Difference]: With dead ends: 850 [2019-11-15 20:42:52,653 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 20:42:52,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 20:42:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-15 20:42:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 609 transitions. [2019-11-15 20:42:52,666 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 609 transitions. Word has length 86 [2019-11-15 20:42:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:52,667 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 609 transitions. [2019-11-15 20:42:52,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 609 transitions. [2019-11-15 20:42:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 20:42:52,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:52,668 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:52,669 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 862290981, now seen corresponding path program 1 times [2019-11-15 20:42:52,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:52,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535866512] [2019-11-15 20:42:52,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:52,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:52,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:52,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535866512] [2019-11-15 20:42:52,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:52,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:52,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72378915] [2019-11-15 20:42:52,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:52,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:52,739 INFO L87 Difference]: Start difference. First operand 408 states and 609 transitions. Second operand 4 states. [2019-11-15 20:42:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:53,099 INFO L93 Difference]: Finished difference Result 705 states and 1043 transitions. [2019-11-15 20:42:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:53,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 20:42:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:53,103 INFO L225 Difference]: With dead ends: 705 [2019-11-15 20:42:53,103 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 20:42:53,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 20:42:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-15 20:42:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-11-15 20:42:53,116 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 86 [2019-11-15 20:42:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:53,117 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-11-15 20:42:53,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-11-15 20:42:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 20:42:53,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:53,119 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-15 20:42:53,119 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1732038594, now seen corresponding path program 1 times [2019-11-15 20:42:53,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:53,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709711807] [2019-11-15 20:42:53,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:53,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:53,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709711807] [2019-11-15 20:42:53,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:53,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:53,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436789182] [2019-11-15 20:42:53,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:53,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:53,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:53,204 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 4 states. [2019-11-15 20:42:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:53,724 INFO L93 Difference]: Finished difference Result 930 states and 1377 transitions. [2019-11-15 20:42:53,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:53,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 20:42:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:53,728 INFO L225 Difference]: With dead ends: 930 [2019-11-15 20:42:53,728 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 20:42:53,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 20:42:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-15 20:42:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2019-11-15 20:42:53,744 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 87 [2019-11-15 20:42:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:53,745 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2019-11-15 20:42:53,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2019-11-15 20:42:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 20:42:53,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:53,747 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:53,747 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 442060930, now seen corresponding path program 1 times [2019-11-15 20:42:53,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:53,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735507201] [2019-11-15 20:42:53,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:53,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:53,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:53,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735507201] [2019-11-15 20:42:53,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:53,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:53,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138584515] [2019-11-15 20:42:53,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:53,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:53,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:53,815 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand 4 states. [2019-11-15 20:42:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:54,347 INFO L93 Difference]: Finished difference Result 779 states and 1151 transitions. [2019-11-15 20:42:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:54,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 20:42:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:54,354 INFO L225 Difference]: With dead ends: 779 [2019-11-15 20:42:54,354 INFO L226 Difference]: Without dead ends: 526 [2019-11-15 20:42:54,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-15 20:42:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 408. [2019-11-15 20:42:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 603 transitions. [2019-11-15 20:42:54,368 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 603 transitions. Word has length 87 [2019-11-15 20:42:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:54,368 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 603 transitions. [2019-11-15 20:42:54,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 603 transitions. [2019-11-15 20:42:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 20:42:54,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:54,370 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-15 20:42:54,370 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 360231296, now seen corresponding path program 1 times [2019-11-15 20:42:54,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:54,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367229938] [2019-11-15 20:42:54,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:54,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:54,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:54,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367229938] [2019-11-15 20:42:54,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:54,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:54,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691619181] [2019-11-15 20:42:54,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:54,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:54,433 INFO L87 Difference]: Start difference. First operand 408 states and 603 transitions. Second operand 4 states. [2019-11-15 20:42:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:54,836 INFO L93 Difference]: Finished difference Result 850 states and 1248 transitions. [2019-11-15 20:42:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:54,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 20:42:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:54,840 INFO L225 Difference]: With dead ends: 850 [2019-11-15 20:42:54,840 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 20:42:54,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 20:42:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-15 20:42:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 601 transitions. [2019-11-15 20:42:54,855 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 601 transitions. Word has length 87 [2019-11-15 20:42:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:54,856 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 601 transitions. [2019-11-15 20:42:54,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 601 transitions. [2019-11-15 20:42:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 20:42:54,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:54,858 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:54,858 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash -929746368, now seen corresponding path program 1 times [2019-11-15 20:42:54,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:54,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032577239] [2019-11-15 20:42:54,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:54,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:54,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032577239] [2019-11-15 20:42:54,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:54,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:54,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228610209] [2019-11-15 20:42:54,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:54,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:54,939 INFO L87 Difference]: Start difference. First operand 408 states and 601 transitions. Second operand 4 states. [2019-11-15 20:42:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:55,357 INFO L93 Difference]: Finished difference Result 699 states and 1024 transitions. [2019-11-15 20:42:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:55,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 20:42:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:55,362 INFO L225 Difference]: With dead ends: 699 [2019-11-15 20:42:55,362 INFO L226 Difference]: Without dead ends: 446 [2019-11-15 20:42:55,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-15 20:42:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 408. [2019-11-15 20:42:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 599 transitions. [2019-11-15 20:42:55,376 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 599 transitions. Word has length 87 [2019-11-15 20:42:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:55,376 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 599 transitions. [2019-11-15 20:42:55,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 599 transitions. [2019-11-15 20:42:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 20:42:55,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:55,378 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 20:42:55,378 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1973824157, now seen corresponding path program 1 times [2019-11-15 20:42:55,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:55,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129859806] [2019-11-15 20:42:55,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:55,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:55,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:55,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129859806] [2019-11-15 20:42:55,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:55,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:55,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179745135] [2019-11-15 20:42:55,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:55,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:55,448 INFO L87 Difference]: Start difference. First operand 408 states and 599 transitions. Second operand 4 states. [2019-11-15 20:42:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:55,934 INFO L93 Difference]: Finished difference Result 906 states and 1332 transitions. [2019-11-15 20:42:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:55,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 20:42:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:55,938 INFO L225 Difference]: With dead ends: 906 [2019-11-15 20:42:55,938 INFO L226 Difference]: Without dead ends: 508 [2019-11-15 20:42:55,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-15 20:42:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-11-15 20:42:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 597 transitions. [2019-11-15 20:42:55,953 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 597 transitions. Word has length 88 [2019-11-15 20:42:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:55,954 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 597 transitions. [2019-11-15 20:42:55,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 597 transitions. [2019-11-15 20:42:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 20:42:55,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:55,956 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 20:42:55,956 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1550177435, now seen corresponding path program 1 times [2019-11-15 20:42:55,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:55,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284517533] [2019-11-15 20:42:55,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:55,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:55,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:56,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284517533] [2019-11-15 20:42:56,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:56,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:56,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346583729] [2019-11-15 20:42:56,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:56,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:56,023 INFO L87 Difference]: Start difference. First operand 408 states and 597 transitions. Second operand 4 states. [2019-11-15 20:42:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:56,340 INFO L93 Difference]: Finished difference Result 826 states and 1207 transitions. [2019-11-15 20:42:56,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:56,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 20:42:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:56,344 INFO L225 Difference]: With dead ends: 826 [2019-11-15 20:42:56,344 INFO L226 Difference]: Without dead ends: 428 [2019-11-15 20:42:56,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-15 20:42:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 408. [2019-11-15 20:42:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 595 transitions. [2019-11-15 20:42:56,358 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 595 transitions. Word has length 88 [2019-11-15 20:42:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:56,359 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 595 transitions. [2019-11-15 20:42:56,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 595 transitions. [2019-11-15 20:42:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 20:42:56,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:56,361 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:56,361 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:56,361 INFO L82 PathProgramCache]: Analyzing trace with hash 114296894, now seen corresponding path program 1 times [2019-11-15 20:42:56,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:56,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240445269] [2019-11-15 20:42:56,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:56,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:56,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:42:56,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240445269] [2019-11-15 20:42:56,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:56,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:56,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114551537] [2019-11-15 20:42:56,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:56,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:56,441 INFO L87 Difference]: Start difference. First operand 408 states and 595 transitions. Second operand 4 states. [2019-11-15 20:42:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:56,901 INFO L93 Difference]: Finished difference Result 906 states and 1324 transitions. [2019-11-15 20:42:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:56,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 20:42:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:56,905 INFO L225 Difference]: With dead ends: 906 [2019-11-15 20:42:56,905 INFO L226 Difference]: Without dead ends: 508 [2019-11-15 20:42:56,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-15 20:42:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-11-15 20:42:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 20:42:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 593 transitions. [2019-11-15 20:42:56,919 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 593 transitions. Word has length 89 [2019-11-15 20:42:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:56,919 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 593 transitions. [2019-11-15 20:42:56,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 593 transitions. [2019-11-15 20:42:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 20:42:56,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:56,921 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:56,921 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 362443388, now seen corresponding path program 1 times [2019-11-15 20:42:56,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:56,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921599897] [2019-11-15 20:42:56,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:56,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:56,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:56,989 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-15 20:42:56,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921599897] [2019-11-15 20:42:56,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:56,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:56,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995781681] [2019-11-15 20:42:56,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:56,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:56,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:56,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:56,991 INFO L87 Difference]: Start difference. First operand 408 states and 593 transitions. Second operand 3 states. [2019-11-15 20:42:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:57,031 INFO L93 Difference]: Finished difference Result 808 states and 1181 transitions. [2019-11-15 20:42:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:57,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 20:42:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:57,036 INFO L225 Difference]: With dead ends: 808 [2019-11-15 20:42:57,036 INFO L226 Difference]: Without dead ends: 557 [2019-11-15 20:42:57,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-15 20:42:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-11-15 20:42:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-11-15 20:42:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 810 transitions. [2019-11-15 20:42:57,053 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 810 transitions. Word has length 89 [2019-11-15 20:42:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:57,053 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 810 transitions. [2019-11-15 20:42:57,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 810 transitions. [2019-11-15 20:42:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:42:57,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:57,055 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:57,055 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 846505389, now seen corresponding path program 1 times [2019-11-15 20:42:57,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:57,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59115101] [2019-11-15 20:42:57,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:57,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:57,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 20:42:57,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59115101] [2019-11-15 20:42:57,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:57,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:57,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450928054] [2019-11-15 20:42:57,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:57,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:57,114 INFO L87 Difference]: Start difference. First operand 557 states and 810 transitions. Second operand 3 states. [2019-11-15 20:42:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:57,152 INFO L93 Difference]: Finished difference Result 1106 states and 1615 transitions. [2019-11-15 20:42:57,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:57,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-15 20:42:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:57,156 INFO L225 Difference]: With dead ends: 1106 [2019-11-15 20:42:57,156 INFO L226 Difference]: Without dead ends: 706 [2019-11-15 20:42:57,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-11-15 20:42:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2019-11-15 20:42:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-15 20:42:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1028 transitions. [2019-11-15 20:42:57,177 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1028 transitions. Word has length 91 [2019-11-15 20:42:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:57,178 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 1028 transitions. [2019-11-15 20:42:57,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1028 transitions. [2019-11-15 20:42:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 20:42:57,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:57,181 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-11-15 20:42:57,181 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-11-15 20:42:57,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:57,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40840836] [2019-11-15 20:42:57,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:57,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:57,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 20:42:57,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40840836] [2019-11-15 20:42:57,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:57,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:57,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142162542] [2019-11-15 20:42:57,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:57,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:57,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:57,254 INFO L87 Difference]: Start difference. First operand 706 states and 1028 transitions. Second operand 3 states. [2019-11-15 20:42:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:57,294 INFO L93 Difference]: Finished difference Result 857 states and 1249 transitions. [2019-11-15 20:42:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:57,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-15 20:42:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:57,300 INFO L225 Difference]: With dead ends: 857 [2019-11-15 20:42:57,300 INFO L226 Difference]: Without dead ends: 855 [2019-11-15 20:42:57,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-15 20:42:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-15 20:42:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-15 20:42:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1247 transitions. [2019-11-15 20:42:57,325 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1247 transitions. Word has length 112 [2019-11-15 20:42:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:57,325 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1247 transitions. [2019-11-15 20:42:57,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1247 transitions. [2019-11-15 20:42:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 20:42:57,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:57,328 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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-15 20:42:57,328 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:57,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1925270538, now seen corresponding path program 1 times [2019-11-15 20:42:57,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:57,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332064132] [2019-11-15 20:42:57,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:57,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:57,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 20:42:57,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332064132] [2019-11-15 20:42:57,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:57,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:57,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492660202] [2019-11-15 20:42:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:57,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:57,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:57,422 INFO L87 Difference]: Start difference. First operand 855 states and 1247 transitions. Second operand 4 states. [2019-11-15 20:42:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:58,021 INFO L93 Difference]: Finished difference Result 2245 states and 3305 transitions. [2019-11-15 20:42:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:58,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-15 20:42:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:58,029 INFO L225 Difference]: With dead ends: 2245 [2019-11-15 20:42:58,030 INFO L226 Difference]: Without dead ends: 1400 [2019-11-15 20:42:58,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-11-15 20:42:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 975. [2019-11-15 20:42:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-11-15 20:42:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1451 transitions. [2019-11-15 20:42:58,062 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1451 transitions. Word has length 133 [2019-11-15 20:42:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:58,063 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 1451 transitions. [2019-11-15 20:42:58,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1451 transitions. [2019-11-15 20:42:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 20:42:58,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:58,066 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:58,066 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1572785965, now seen corresponding path program 1 times [2019-11-15 20:42:58,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:58,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795443654] [2019-11-15 20:42:58,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:58,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:58,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 20:42:58,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795443654] [2019-11-15 20:42:58,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:58,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:58,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735184380] [2019-11-15 20:42:58,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:58,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:58,191 INFO L87 Difference]: Start difference. First operand 975 states and 1451 transitions. Second operand 4 states. [2019-11-15 20:42:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:58,734 INFO L93 Difference]: Finished difference Result 2329 states and 3455 transitions. [2019-11-15 20:42:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:58,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-15 20:42:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:58,742 INFO L225 Difference]: With dead ends: 2329 [2019-11-15 20:42:58,742 INFO L226 Difference]: Without dead ends: 1364 [2019-11-15 20:42:58,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-15 20:42:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-11-15 20:42:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 981. [2019-11-15 20:42:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:42:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1457 transitions. [2019-11-15 20:42:58,776 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1457 transitions. Word has length 134 [2019-11-15 20:42:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:58,777 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1457 transitions. [2019-11-15 20:42:58,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1457 transitions. [2019-11-15 20:42:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 20:42:58,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:58,780 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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-15 20:42:58,781 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1571626994, now seen corresponding path program 2 times [2019-11-15 20:42:58,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:58,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070100432] [2019-11-15 20:42:58,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:58,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:58,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:42:58,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070100432] [2019-11-15 20:42:58,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:58,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:58,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263332254] [2019-11-15 20:42:58,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:58,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:58,872 INFO L87 Difference]: Start difference. First operand 981 states and 1457 transitions. Second operand 4 states. [2019-11-15 20:42:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:59,449 INFO L93 Difference]: Finished difference Result 2329 states and 3449 transitions. [2019-11-15 20:42:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:42:59,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-15 20:42:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:59,458 INFO L225 Difference]: With dead ends: 2329 [2019-11-15 20:42:59,459 INFO L226 Difference]: Without dead ends: 1358 [2019-11-15 20:42:59,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:42:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-11-15 20:42:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 981. [2019-11-15 20:42:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:42:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1451 transitions. [2019-11-15 20:42:59,496 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1451 transitions. Word has length 147 [2019-11-15 20:42:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:59,496 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1451 transitions. [2019-11-15 20:42:59,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:42:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1451 transitions. [2019-11-15 20:42:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 20:42:59,500 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:59,500 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 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-15 20:42:59,500 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2106868720, now seen corresponding path program 1 times [2019-11-15 20:42:59,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:59,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592637277] [2019-11-15 20:42:59,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:59,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:59,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:42:59,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592637277] [2019-11-15 20:42:59,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:59,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:42:59,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641102423] [2019-11-15 20:42:59,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:42:59,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:42:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:42:59,591 INFO L87 Difference]: Start difference. First operand 981 states and 1451 transitions. Second operand 4 states. [2019-11-15 20:43:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:00,166 INFO L93 Difference]: Finished difference Result 2329 states and 3437 transitions. [2019-11-15 20:43:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:00,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-15 20:43:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:00,175 INFO L225 Difference]: With dead ends: 2329 [2019-11-15 20:43:00,175 INFO L226 Difference]: Without dead ends: 1358 [2019-11-15 20:43:00,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-11-15 20:43:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 981. [2019-11-15 20:43:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1445 transitions. [2019-11-15 20:43:00,212 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1445 transitions. Word has length 147 [2019-11-15 20:43:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:00,212 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1445 transitions. [2019-11-15 20:43:00,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1445 transitions. [2019-11-15 20:43:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 20:43:00,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,216 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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-15 20:43:00,216 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash 266082969, now seen corresponding path program 1 times [2019-11-15 20:43:00,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311017465] [2019-11-15 20:43:00,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:00,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311017465] [2019-11-15 20:43:00,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:00,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:00,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393803120] [2019-11-15 20:43:00,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:00,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:00,303 INFO L87 Difference]: Start difference. First operand 981 states and 1445 transitions. Second operand 4 states. [2019-11-15 20:43:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:00,860 INFO L93 Difference]: Finished difference Result 2329 states and 3425 transitions. [2019-11-15 20:43:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:00,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 20:43:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:00,869 INFO L225 Difference]: With dead ends: 2329 [2019-11-15 20:43:00,869 INFO L226 Difference]: Without dead ends: 1358 [2019-11-15 20:43:00,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-11-15 20:43:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 981. [2019-11-15 20:43:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1439 transitions. [2019-11-15 20:43:00,909 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1439 transitions. Word has length 148 [2019-11-15 20:43:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:00,910 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1439 transitions. [2019-11-15 20:43:00,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1439 transitions. [2019-11-15 20:43:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 20:43:00,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,913 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 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-15 20:43:00,914 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1863964706, now seen corresponding path program 1 times [2019-11-15 20:43:00,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265618942] [2019-11-15 20:43:00,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 173 proven. 37 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-15 20:43:01,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265618942] [2019-11-15 20:43:01,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981636904] [2019-11-15 20:43:01,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:01,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:01,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:01,344 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:01,345 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:01,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:01,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:01,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:01,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:01,391 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:01,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:01,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:01,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:01,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:01,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:01,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:01,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 20:43:01,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211557235] [2019-11-15 20:43:01,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:01,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:01,437 INFO L87 Difference]: Start difference. First operand 981 states and 1439 transitions. Second operand 4 states. [2019-11-15 20:43:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:02,129 INFO L93 Difference]: Finished difference Result 2163 states and 3172 transitions. [2019-11-15 20:43:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:02,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 20:43:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:02,139 INFO L225 Difference]: With dead ends: 2163 [2019-11-15 20:43:02,139 INFO L226 Difference]: Without dead ends: 1358 [2019-11-15 20:43:02,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:43:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-11-15 20:43:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 981. [2019-11-15 20:43:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1433 transitions. [2019-11-15 20:43:02,243 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1433 transitions. Word has length 148 [2019-11-15 20:43:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:02,243 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1433 transitions. [2019-11-15 20:43:02,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1433 transitions. [2019-11-15 20:43:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 20:43:02,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:02,248 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-15 20:43:02,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:02,452 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2110840331, now seen corresponding path program 1 times [2019-11-15 20:43:02,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:02,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036622515] [2019-11-15 20:43:02,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:02,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:02,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:02,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036622515] [2019-11-15 20:43:02,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:02,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:02,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390027935] [2019-11-15 20:43:02,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:02,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:02,572 INFO L87 Difference]: Start difference. First operand 981 states and 1433 transitions. Second operand 4 states. [2019-11-15 20:43:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:03,084 INFO L93 Difference]: Finished difference Result 2329 states and 3401 transitions. [2019-11-15 20:43:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:03,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 20:43:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:03,093 INFO L225 Difference]: With dead ends: 2329 [2019-11-15 20:43:03,093 INFO L226 Difference]: Without dead ends: 1358 [2019-11-15 20:43:03,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-11-15 20:43:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 981. [2019-11-15 20:43:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1427 transitions. [2019-11-15 20:43:03,129 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1427 transitions. Word has length 149 [2019-11-15 20:43:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:03,129 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1427 transitions. [2019-11-15 20:43:03,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1427 transitions. [2019-11-15 20:43:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 20:43:03,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:03,133 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:03,133 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash -634480331, now seen corresponding path program 1 times [2019-11-15 20:43:03,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:03,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101243757] [2019-11-15 20:43:03,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:03,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:03,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 175 proven. 38 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-15 20:43:03,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101243757] [2019-11-15 20:43:03,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998118911] [2019-11-15 20:43:03,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:43:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:03,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:03,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:03,475 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:03,475 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:03,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:03,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:03,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:03,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:03,503 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:03,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:03,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:03,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:03,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:03,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:03,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:43:03,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 20:43:03,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107962083] [2019-11-15 20:43:03,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:03,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:03,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:03,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:03,544 INFO L87 Difference]: Start difference. First operand 981 states and 1427 transitions. Second operand 4 states. [2019-11-15 20:43:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:04,110 INFO L93 Difference]: Finished difference Result 2146 states and 3129 transitions. [2019-11-15 20:43:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:04,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 20:43:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:04,118 INFO L225 Difference]: With dead ends: 2146 [2019-11-15 20:43:04,119 INFO L226 Difference]: Without dead ends: 1341 [2019-11-15 20:43:04,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:43:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-15 20:43:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 981. [2019-11-15 20:43:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1421 transitions. [2019-11-15 20:43:04,159 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1421 transitions. Word has length 149 [2019-11-15 20:43:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:04,160 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1421 transitions. [2019-11-15 20:43:04,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1421 transitions. [2019-11-15 20:43:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 20:43:04,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:04,163 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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-15 20:43:04,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:04,368 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1410032930, now seen corresponding path program 1 times [2019-11-15 20:43:04,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:04,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505276366] [2019-11-15 20:43:04,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:04,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:04,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:04,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505276366] [2019-11-15 20:43:04,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:04,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:04,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924923726] [2019-11-15 20:43:04,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:04,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:04,456 INFO L87 Difference]: Start difference. First operand 981 states and 1421 transitions. Second operand 4 states. [2019-11-15 20:43:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:05,010 INFO L93 Difference]: Finished difference Result 2258 states and 3290 transitions. [2019-11-15 20:43:05,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:05,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-15 20:43:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:05,018 INFO L225 Difference]: With dead ends: 2258 [2019-11-15 20:43:05,019 INFO L226 Difference]: Without dead ends: 1287 [2019-11-15 20:43:05,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-11-15 20:43:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 981. [2019-11-15 20:43:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1415 transitions. [2019-11-15 20:43:05,057 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1415 transitions. Word has length 150 [2019-11-15 20:43:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:05,057 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1415 transitions. [2019-11-15 20:43:05,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1415 transitions. [2019-11-15 20:43:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 20:43:05,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:05,061 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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-15 20:43:05,061 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash 857122132, now seen corresponding path program 1 times [2019-11-15 20:43:05,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:05,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330115923] [2019-11-15 20:43:05,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:05,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:05,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:05,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330115923] [2019-11-15 20:43:05,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:05,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:05,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023192350] [2019-11-15 20:43:05,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:05,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:05,152 INFO L87 Difference]: Start difference. First operand 981 states and 1415 transitions. Second operand 4 states. [2019-11-15 20:43:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:05,691 INFO L93 Difference]: Finished difference Result 2258 states and 3278 transitions. [2019-11-15 20:43:05,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:05,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 20:43:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:05,707 INFO L225 Difference]: With dead ends: 2258 [2019-11-15 20:43:05,712 INFO L226 Difference]: Without dead ends: 1287 [2019-11-15 20:43:05,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-11-15 20:43:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 981. [2019-11-15 20:43:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1409 transitions. [2019-11-15 20:43:05,748 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1409 transitions. Word has length 151 [2019-11-15 20:43:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:05,748 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1409 transitions. [2019-11-15 20:43:05,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1409 transitions. [2019-11-15 20:43:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 20:43:05,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:05,752 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:05,752 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -296459971, now seen corresponding path program 1 times [2019-11-15 20:43:05,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:05,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619342846] [2019-11-15 20:43:05,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:05,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:05,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:05,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619342846] [2019-11-15 20:43:05,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:05,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:05,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645912158] [2019-11-15 20:43:05,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:05,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:05,832 INFO L87 Difference]: Start difference. First operand 981 states and 1409 transitions. Second operand 4 states. [2019-11-15 20:43:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:06,402 INFO L93 Difference]: Finished difference Result 2236 states and 3235 transitions. [2019-11-15 20:43:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:06,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 20:43:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:06,414 INFO L225 Difference]: With dead ends: 2236 [2019-11-15 20:43:06,414 INFO L226 Difference]: Without dead ends: 1265 [2019-11-15 20:43:06,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-15 20:43:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 981. [2019-11-15 20:43:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 20:43:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1403 transitions. [2019-11-15 20:43:06,454 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1403 transitions. Word has length 152 [2019-11-15 20:43:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:06,454 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1403 transitions. [2019-11-15 20:43:06,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1403 transitions. [2019-11-15 20:43:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 20:43:06,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:06,458 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:06,458 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:06,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1875676295, now seen corresponding path program 1 times [2019-11-15 20:43:06,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:06,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626853278] [2019-11-15 20:43:06,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:06,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:06,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-15 20:43:06,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626853278] [2019-11-15 20:43:06,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:06,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:06,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37295956] [2019-11-15 20:43:06,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:06,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:06,556 INFO L87 Difference]: Start difference. First operand 981 states and 1403 transitions. Second operand 4 states. [2019-11-15 20:43:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:07,197 INFO L93 Difference]: Finished difference Result 2497 states and 3617 transitions. [2019-11-15 20:43:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:07,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-15 20:43:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:07,206 INFO L225 Difference]: With dead ends: 2497 [2019-11-15 20:43:07,206 INFO L226 Difference]: Without dead ends: 1526 [2019-11-15 20:43:07,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2019-11-15 20:43:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1101. [2019-11-15 20:43:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-11-15 20:43:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1607 transitions. [2019-11-15 20:43:07,246 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1607 transitions. Word has length 155 [2019-11-15 20:43:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:07,247 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1607 transitions. [2019-11-15 20:43:07,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1607 transitions. [2019-11-15 20:43:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 20:43:07,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:07,250 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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-15 20:43:07,250 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1184759798, now seen corresponding path program 1 times [2019-11-15 20:43:07,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:07,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881253148] [2019-11-15 20:43:07,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:07,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:07,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-15 20:43:07,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881253148] [2019-11-15 20:43:07,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:07,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:07,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827046848] [2019-11-15 20:43:07,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:07,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:07,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:07,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:07,346 INFO L87 Difference]: Start difference. First operand 1101 states and 1607 transitions. Second operand 4 states. [2019-11-15 20:43:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:07,926 INFO L93 Difference]: Finished difference Result 2581 states and 3767 transitions. [2019-11-15 20:43:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:07,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 20:43:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:07,930 INFO L225 Difference]: With dead ends: 2581 [2019-11-15 20:43:07,930 INFO L226 Difference]: Without dead ends: 1490 [2019-11-15 20:43:07,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-11-15 20:43:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1095. [2019-11-15 20:43:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-11-15 20:43:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1601 transitions. [2019-11-15 20:43:07,970 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1601 transitions. Word has length 156 [2019-11-15 20:43:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:07,971 INFO L462 AbstractCegarLoop]: Abstraction has 1095 states and 1601 transitions. [2019-11-15 20:43:07,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1601 transitions. [2019-11-15 20:43:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 20:43:07,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:07,975 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:07,975 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash 107864900, now seen corresponding path program 1 times [2019-11-15 20:43:07,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:07,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102196281] [2019-11-15 20:43:07,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:07,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:07,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:43:08,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102196281] [2019-11-15 20:43:08,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:08,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:08,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19322594] [2019-11-15 20:43:08,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:08,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:08,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:08,062 INFO L87 Difference]: Start difference. First operand 1095 states and 1601 transitions. Second operand 4 states. [2019-11-15 20:43:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:08,436 INFO L93 Difference]: Finished difference Result 2248 states and 3277 transitions. [2019-11-15 20:43:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:08,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-15 20:43:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:08,439 INFO L225 Difference]: With dead ends: 2248 [2019-11-15 20:43:08,439 INFO L226 Difference]: Without dead ends: 1163 [2019-11-15 20:43:08,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-15 20:43:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-11-15 20:43:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1125. [2019-11-15 20:43:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1643 transitions. [2019-11-15 20:43:08,485 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1643 transitions. Word has length 158 [2019-11-15 20:43:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:08,485 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1643 transitions. [2019-11-15 20:43:08,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1643 transitions. [2019-11-15 20:43:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 20:43:08,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:08,489 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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] [2019-11-15 20:43:08,490 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -433372753, now seen corresponding path program 2 times [2019-11-15 20:43:08,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:08,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740833724] [2019-11-15 20:43:08,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:08,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:08,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:08,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740833724] [2019-11-15 20:43:08,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:08,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:08,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401787194] [2019-11-15 20:43:08,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:08,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:08,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:08,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:08,580 INFO L87 Difference]: Start difference. First operand 1125 states and 1643 transitions. Second operand 4 states. [2019-11-15 20:43:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:09,228 INFO L93 Difference]: Finished difference Result 2617 states and 3821 transitions. [2019-11-15 20:43:09,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:09,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-11-15 20:43:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:09,232 INFO L225 Difference]: With dead ends: 2617 [2019-11-15 20:43:09,232 INFO L226 Difference]: Without dead ends: 1502 [2019-11-15 20:43:09,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-11-15 20:43:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1125. [2019-11-15 20:43:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1637 transitions. [2019-11-15 20:43:09,268 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1637 transitions. Word has length 169 [2019-11-15 20:43:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:09,268 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1637 transitions. [2019-11-15 20:43:09,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1637 transitions. [2019-11-15 20:43:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 20:43:09,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:09,272 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 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] [2019-11-15 20:43:09,273 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash 183098829, now seen corresponding path program 1 times [2019-11-15 20:43:09,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:09,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551490285] [2019-11-15 20:43:09,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:09,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:09,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:09,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551490285] [2019-11-15 20:43:09,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:09,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:09,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144949749] [2019-11-15 20:43:09,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:09,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:09,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:09,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:09,357 INFO L87 Difference]: Start difference. First operand 1125 states and 1637 transitions. Second operand 4 states. [2019-11-15 20:43:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:09,791 INFO L93 Difference]: Finished difference Result 2617 states and 3809 transitions. [2019-11-15 20:43:09,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:09,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-11-15 20:43:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:09,795 INFO L225 Difference]: With dead ends: 2617 [2019-11-15 20:43:09,795 INFO L226 Difference]: Without dead ends: 1502 [2019-11-15 20:43:09,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-11-15 20:43:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1125. [2019-11-15 20:43:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1631 transitions. [2019-11-15 20:43:09,840 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1631 transitions. Word has length 169 [2019-11-15 20:43:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:09,840 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1631 transitions. [2019-11-15 20:43:09,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1631 transitions. [2019-11-15 20:43:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 20:43:09,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:09,845 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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] [2019-11-15 20:43:09,845 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1759367044, now seen corresponding path program 1 times [2019-11-15 20:43:09,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:09,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505944091] [2019-11-15 20:43:09,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:09,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:09,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505944091] [2019-11-15 20:43:09,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:09,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:09,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556109041] [2019-11-15 20:43:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:09,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:09,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:09,955 INFO L87 Difference]: Start difference. First operand 1125 states and 1631 transitions. Second operand 4 states. [2019-11-15 20:43:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:10,519 INFO L93 Difference]: Finished difference Result 2617 states and 3797 transitions. [2019-11-15 20:43:10,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:10,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-15 20:43:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:10,522 INFO L225 Difference]: With dead ends: 2617 [2019-11-15 20:43:10,523 INFO L226 Difference]: Without dead ends: 1502 [2019-11-15 20:43:10,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-11-15 20:43:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1125. [2019-11-15 20:43:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1625 transitions. [2019-11-15 20:43:10,558 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1625 transitions. Word has length 170 [2019-11-15 20:43:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:10,559 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1625 transitions. [2019-11-15 20:43:10,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1625 transitions. [2019-11-15 20:43:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 20:43:10,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:10,562 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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-15 20:43:10,563 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash 405552577, now seen corresponding path program 1 times [2019-11-15 20:43:10,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:10,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916817745] [2019-11-15 20:43:10,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:10,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:10,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:10,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916817745] [2019-11-15 20:43:10,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:10,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:10,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862290692] [2019-11-15 20:43:10,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:10,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:10,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:10,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:10,652 INFO L87 Difference]: Start difference. First operand 1125 states and 1625 transitions. Second operand 4 states. [2019-11-15 20:43:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:11,214 INFO L93 Difference]: Finished difference Result 2427 states and 3513 transitions. [2019-11-15 20:43:11,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:11,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-15 20:43:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:11,219 INFO L225 Difference]: With dead ends: 2427 [2019-11-15 20:43:11,219 INFO L226 Difference]: Without dead ends: 1502 [2019-11-15 20:43:11,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-15 20:43:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-11-15 20:43:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1125. [2019-11-15 20:43:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1619 transitions. [2019-11-15 20:43:11,260 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1619 transitions. Word has length 170 [2019-11-15 20:43:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:11,260 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1619 transitions. [2019-11-15 20:43:11,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1619 transitions. [2019-11-15 20:43:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 20:43:11,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:11,265 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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] [2019-11-15 20:43:11,265 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -475281294, now seen corresponding path program 1 times [2019-11-15 20:43:11,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:11,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059732574] [2019-11-15 20:43:11,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:11,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:11,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:11,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059732574] [2019-11-15 20:43:11,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:11,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:11,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382841299] [2019-11-15 20:43:11,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:11,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:11,362 INFO L87 Difference]: Start difference. First operand 1125 states and 1619 transitions. Second operand 4 states. [2019-11-15 20:43:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:11,812 INFO L93 Difference]: Finished difference Result 2617 states and 3773 transitions. [2019-11-15 20:43:11,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:11,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-15 20:43:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:11,816 INFO L225 Difference]: With dead ends: 2617 [2019-11-15 20:43:11,816 INFO L226 Difference]: Without dead ends: 1502 [2019-11-15 20:43:11,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-11-15 20:43:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1125. [2019-11-15 20:43:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1613 transitions. [2019-11-15 20:43:11,857 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1613 transitions. Word has length 171 [2019-11-15 20:43:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:11,859 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1613 transitions. [2019-11-15 20:43:11,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1613 transitions. [2019-11-15 20:43:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 20:43:11,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:11,861 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:11,861 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1001078706, now seen corresponding path program 1 times [2019-11-15 20:43:11,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:11,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640629824] [2019-11-15 20:43:11,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:11,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:11,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:11,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640629824] [2019-11-15 20:43:11,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:11,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:11,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479571665] [2019-11-15 20:43:11,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:11,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:11,945 INFO L87 Difference]: Start difference. First operand 1125 states and 1613 transitions. Second operand 4 states. [2019-11-15 20:43:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:12,439 INFO L93 Difference]: Finished difference Result 2410 states and 3470 transitions. [2019-11-15 20:43:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:12,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-15 20:43:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:12,442 INFO L225 Difference]: With dead ends: 2410 [2019-11-15 20:43:12,443 INFO L226 Difference]: Without dead ends: 1485 [2019-11-15 20:43:12,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-11-15 20:43:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1125. [2019-11-15 20:43:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1607 transitions. [2019-11-15 20:43:12,484 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1607 transitions. Word has length 171 [2019-11-15 20:43:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:12,484 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1607 transitions. [2019-11-15 20:43:12,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1607 transitions. [2019-11-15 20:43:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 20:43:12,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:12,487 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 5, 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] [2019-11-15 20:43:12,487 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2047656961, now seen corresponding path program 1 times [2019-11-15 20:43:12,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:12,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599391699] [2019-11-15 20:43:12,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:12,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:12,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:12,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599391699] [2019-11-15 20:43:12,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:12,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:12,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145596082] [2019-11-15 20:43:12,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:12,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:12,577 INFO L87 Difference]: Start difference. First operand 1125 states and 1607 transitions. Second operand 4 states. [2019-11-15 20:43:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:13,007 INFO L93 Difference]: Finished difference Result 2546 states and 3662 transitions. [2019-11-15 20:43:13,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:13,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-15 20:43:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:13,009 INFO L225 Difference]: With dead ends: 2546 [2019-11-15 20:43:13,010 INFO L226 Difference]: Without dead ends: 1431 [2019-11-15 20:43:13,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-11-15 20:43:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1125. [2019-11-15 20:43:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1601 transitions. [2019-11-15 20:43:13,049 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1601 transitions. Word has length 172 [2019-11-15 20:43:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:13,050 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1601 transitions. [2019-11-15 20:43:13,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1601 transitions. [2019-11-15 20:43:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 20:43:13,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:13,052 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 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-15 20:43:13,053 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash 671326353, now seen corresponding path program 1 times [2019-11-15 20:43:13,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:13,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730682802] [2019-11-15 20:43:13,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:13,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:13,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:13,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730682802] [2019-11-15 20:43:13,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:13,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:13,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823873956] [2019-11-15 20:43:13,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:13,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:13,147 INFO L87 Difference]: Start difference. First operand 1125 states and 1601 transitions. Second operand 4 states. [2019-11-15 20:43:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:13,699 INFO L93 Difference]: Finished difference Result 2546 states and 3650 transitions. [2019-11-15 20:43:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:13,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-15 20:43:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:13,703 INFO L225 Difference]: With dead ends: 2546 [2019-11-15 20:43:13,703 INFO L226 Difference]: Without dead ends: 1431 [2019-11-15 20:43:13,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-11-15 20:43:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1125. [2019-11-15 20:43:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1595 transitions. [2019-11-15 20:43:13,744 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1595 transitions. Word has length 173 [2019-11-15 20:43:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:13,744 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1595 transitions. [2019-11-15 20:43:13,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1595 transitions. [2019-11-15 20:43:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 20:43:13,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:13,747 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:13,747 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1761161824, now seen corresponding path program 1 times [2019-11-15 20:43:13,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:13,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032347448] [2019-11-15 20:43:13,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:13,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:13,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:43:13,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032347448] [2019-11-15 20:43:13,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:13,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:13,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824663339] [2019-11-15 20:43:13,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:13,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:13,847 INFO L87 Difference]: Start difference. First operand 1125 states and 1595 transitions. Second operand 4 states. [2019-11-15 20:43:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:14,441 INFO L93 Difference]: Finished difference Result 2524 states and 3607 transitions. [2019-11-15 20:43:14,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:14,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 20:43:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:14,446 INFO L225 Difference]: With dead ends: 2524 [2019-11-15 20:43:14,446 INFO L226 Difference]: Without dead ends: 1409 [2019-11-15 20:43:14,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-11-15 20:43:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1125. [2019-11-15 20:43:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-15 20:43:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1589 transitions. [2019-11-15 20:43:14,488 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1589 transitions. Word has length 174 [2019-11-15 20:43:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:14,489 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1589 transitions. [2019-11-15 20:43:14,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1589 transitions. [2019-11-15 20:43:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 20:43:14,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:14,492 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:14,492 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2007513447, now seen corresponding path program 1 times [2019-11-15 20:43:14,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:14,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049742164] [2019-11-15 20:43:14,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:14,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:14,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-11-15 20:43:14,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049742164] [2019-11-15 20:43:14,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093566661] [2019-11-15 20:43:14,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:14,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:14,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:14,919 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-15 20:43:14,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:14,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:14,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:14,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:14,949 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:14,950 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:14,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:14,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:14,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:14,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:14,987 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:14,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:14,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:14,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:14,991 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-15 20:43:14,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-11-15 20:43:15,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:15,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 20:43:15,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903476232] [2019-11-15 20:43:15,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:43:15,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:15,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:43:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:43:15,040 INFO L87 Difference]: Start difference. First operand 1125 states and 1589 transitions. Second operand 9 states. [2019-11-15 20:43:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:16,191 INFO L93 Difference]: Finished difference Result 3088 states and 4437 transitions. [2019-11-15 20:43:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:43:16,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-11-15 20:43:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:16,194 INFO L225 Difference]: With dead ends: 3088 [2019-11-15 20:43:16,194 INFO L226 Difference]: Without dead ends: 1973 [2019-11-15 20:43:16,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:43:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-11-15 20:43:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1401. [2019-11-15 20:43:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-15 20:43:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2052 transitions. [2019-11-15 20:43:16,237 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2052 transitions. Word has length 180 [2019-11-15 20:43:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:16,237 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2052 transitions. [2019-11-15 20:43:16,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:43:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2052 transitions. [2019-11-15 20:43:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 20:43:16,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:16,241 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:16,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:16,445 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1901435876, now seen corresponding path program 1 times [2019-11-15 20:43:16,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:16,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179942700] [2019-11-15 20:43:16,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:16,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:16,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 198 proven. 35 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-11-15 20:43:16,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179942700] [2019-11-15 20:43:16,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798489643] [2019-11-15 20:43:16,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:16,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:16,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:16,823 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-15 20:43:16,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:16,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:16,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:16,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:16,849 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:16,850 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:16,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:16,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:16,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:16,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:16,886 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:16,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:16,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:16,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:16,890 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-15 20:43:16,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 198 proven. 35 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-11-15 20:43:16,939 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:16,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 20:43:16,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403938356] [2019-11-15 20:43:16,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:16,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:16,941 INFO L87 Difference]: Start difference. First operand 1401 states and 2052 transitions. Second operand 8 states. [2019-11-15 20:43:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:17,795 INFO L93 Difference]: Finished difference Result 2939 states and 4277 transitions. [2019-11-15 20:43:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:17,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-11-15 20:43:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:17,804 INFO L225 Difference]: With dead ends: 2939 [2019-11-15 20:43:17,804 INFO L226 Difference]: Without dead ends: 1548 [2019-11-15 20:43:17,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2019-11-15 20:43:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1401. [2019-11-15 20:43:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-15 20:43:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2040 transitions. [2019-11-15 20:43:17,854 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2040 transitions. Word has length 195 [2019-11-15 20:43:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:17,854 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2040 transitions. [2019-11-15 20:43:17,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2040 transitions. [2019-11-15 20:43:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 20:43:17,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:17,858 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:18,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:18,062 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1920091334, now seen corresponding path program 1 times [2019-11-15 20:43:18,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:18,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398536134] [2019-11-15 20:43:18,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:18,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:18,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 201 proven. 32 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-11-15 20:43:18,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398536134] [2019-11-15 20:43:18,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779490262] [2019-11-15 20:43:18,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:18,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:18,461 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-15 20:43:18,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:18,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:18,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:18,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:18,493 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:18,494 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:18,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:18,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:18,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:18,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:18,525 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:18,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:18,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:18,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:18,529 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-15 20:43:18,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 201 proven. 32 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-11-15 20:43:18,624 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:18,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 20:43:18,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379097625] [2019-11-15 20:43:18,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:18,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:18,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:18,626 INFO L87 Difference]: Start difference. First operand 1401 states and 2040 transitions. Second operand 8 states. [2019-11-15 20:43:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:19,445 INFO L93 Difference]: Finished difference Result 2994 states and 4320 transitions. [2019-11-15 20:43:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:19,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-11-15 20:43:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:19,447 INFO L225 Difference]: With dead ends: 2994 [2019-11-15 20:43:19,447 INFO L226 Difference]: Without dead ends: 1603 [2019-11-15 20:43:19,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-15 20:43:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1401. [2019-11-15 20:43:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-15 20:43:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2028 transitions. [2019-11-15 20:43:19,494 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2028 transitions. Word has length 195 [2019-11-15 20:43:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:19,495 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2028 transitions. [2019-11-15 20:43:19,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2028 transitions. [2019-11-15 20:43:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-15 20:43:19,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:19,498 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:19,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:19,702 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1861498419, now seen corresponding path program 1 times [2019-11-15 20:43:19,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:19,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245389695] [2019-11-15 20:43:19,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:19,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:19,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 206 proven. 29 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-15 20:43:19,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245389695] [2019-11-15 20:43:19,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493391854] [2019-11-15 20:43:19,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:20,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:20,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:20,076 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-15 20:43:20,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:20,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:20,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:20,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:20,096 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:20,096 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:20,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:20,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:20,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:20,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:20,138 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:20,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:20,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:20,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:20,141 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-15 20:43:20,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 206 proven. 29 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-15 20:43:20,184 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:20,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 20:43:20,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636096340] [2019-11-15 20:43:20,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:20,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:20,186 INFO L87 Difference]: Start difference. First operand 1401 states and 2028 transitions. Second operand 8 states. [2019-11-15 20:43:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:21,006 INFO L93 Difference]: Finished difference Result 2994 states and 4296 transitions. [2019-11-15 20:43:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:21,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-11-15 20:43:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:21,009 INFO L225 Difference]: With dead ends: 2994 [2019-11-15 20:43:21,009 INFO L226 Difference]: Without dead ends: 1603 [2019-11-15 20:43:21,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-15 20:43:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1401. [2019-11-15 20:43:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-15 20:43:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2016 transitions. [2019-11-15 20:43:21,045 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2016 transitions. Word has length 196 [2019-11-15 20:43:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:21,046 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2016 transitions. [2019-11-15 20:43:21,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2016 transitions. [2019-11-15 20:43:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-15 20:43:21,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:21,049 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:21,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:21,253 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1149539438, now seen corresponding path program 1 times [2019-11-15 20:43:21,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:21,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843212655] [2019-11-15 20:43:21,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:21,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:21,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 218 proven. 20 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-11-15 20:43:21,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843212655] [2019-11-15 20:43:21,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924578463] [2019-11-15 20:43:21,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:21,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:21,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:21,614 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-15 20:43:21,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:21,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:21,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:21,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:21,637 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:21,637 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:21,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:21,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:21,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:21,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:21,666 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:21,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:21,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:21,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:21,671 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-15 20:43:21,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 218 proven. 20 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-11-15 20:43:21,711 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:21,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 20:43:21,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041998286] [2019-11-15 20:43:21,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:21,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:21,713 INFO L87 Difference]: Start difference. First operand 1401 states and 2016 transitions. Second operand 8 states. [2019-11-15 20:43:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:22,522 INFO L93 Difference]: Finished difference Result 2871 states and 4100 transitions. [2019-11-15 20:43:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:22,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-11-15 20:43:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:22,524 INFO L225 Difference]: With dead ends: 2871 [2019-11-15 20:43:22,524 INFO L226 Difference]: Without dead ends: 1716 [2019-11-15 20:43:22,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2019-11-15 20:43:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1497. [2019-11-15 20:43:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-11-15 20:43:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2148 transitions. [2019-11-15 20:43:22,574 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2148 transitions. Word has length 196 [2019-11-15 20:43:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:22,575 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2148 transitions. [2019-11-15 20:43:22,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2148 transitions. [2019-11-15 20:43:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 20:43:22,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:22,578 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:22,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:22,782 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1708881631, now seen corresponding path program 1 times [2019-11-15 20:43:22,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:22,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866209771] [2019-11-15 20:43:22,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:22,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:22,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 211 proven. 26 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-15 20:43:22,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866209771] [2019-11-15 20:43:22,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456774897] [2019-11-15 20:43:22,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:23,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:23,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:23,194 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-15 20:43:23,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:23,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:23,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:23,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:23,223 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:23,223 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:23,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:23,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:23,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:23,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:23,254 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:23,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:23,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:23,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:23,258 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-15 20:43:23,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 211 proven. 26 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-15 20:43:23,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:23,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 20:43:23,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711299580] [2019-11-15 20:43:23,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:23,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:23,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:23,307 INFO L87 Difference]: Start difference. First operand 1497 states and 2148 transitions. Second operand 8 states. [2019-11-15 20:43:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:24,118 INFO L93 Difference]: Finished difference Result 3186 states and 4536 transitions. [2019-11-15 20:43:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:24,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 197 [2019-11-15 20:43:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:24,119 INFO L225 Difference]: With dead ends: 3186 [2019-11-15 20:43:24,120 INFO L226 Difference]: Without dead ends: 1699 [2019-11-15 20:43:24,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2019-11-15 20:43:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1497. [2019-11-15 20:43:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-11-15 20:43:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2130 transitions. [2019-11-15 20:43:24,157 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2130 transitions. Word has length 197 [2019-11-15 20:43:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:24,157 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2130 transitions. [2019-11-15 20:43:24,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2130 transitions. [2019-11-15 20:43:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 20:43:24,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:24,159 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 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] [2019-11-15 20:43:24,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:24,360 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash 374279711, now seen corresponding path program 1 times [2019-11-15 20:43:24,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:24,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561863834] [2019-11-15 20:43:24,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:24,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:24,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-15 20:43:24,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561863834] [2019-11-15 20:43:24,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:24,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:24,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100445641] [2019-11-15 20:43:24,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:24,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:24,470 INFO L87 Difference]: Start difference. First operand 1497 states and 2130 transitions. Second operand 4 states. [2019-11-15 20:43:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:24,869 INFO L93 Difference]: Finished difference Result 2898 states and 4118 transitions. [2019-11-15 20:43:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:24,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 20:43:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:24,871 INFO L225 Difference]: With dead ends: 2898 [2019-11-15 20:43:24,872 INFO L226 Difference]: Without dead ends: 1665 [2019-11-15 20:43:24,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-11-15 20:43:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1587. [2019-11-15 20:43:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-11-15 20:43:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2255 transitions. [2019-11-15 20:43:24,924 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2255 transitions. Word has length 197 [2019-11-15 20:43:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:24,925 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 2255 transitions. [2019-11-15 20:43:24,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2255 transitions. [2019-11-15 20:43:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 20:43:24,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:24,928 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:24,928 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1819454126, now seen corresponding path program 1 times [2019-11-15 20:43:24,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:24,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512913404] [2019-11-15 20:43:24,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:24,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:24,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 216 proven. 23 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-15 20:43:25,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512913404] [2019-11-15 20:43:25,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467634806] [2019-11-15 20:43:25,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:25,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:25,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:25,302 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-15 20:43:25,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:25,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:25,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:25,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 20:43:25,321 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 20:43:25,321 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:43:25,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:25,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:25,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:25,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 20:43:25,349 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 20:43:25,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 20:43:25,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:25,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:25,352 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-15 20:43:25,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 20:43:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 216 proven. 23 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-15 20:43:25,395 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:25,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 20:43:25,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428498394] [2019-11-15 20:43:25,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:25,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:25,399 INFO L87 Difference]: Start difference. First operand 1587 states and 2255 transitions. Second operand 8 states. [2019-11-15 20:43:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:26,099 INFO L93 Difference]: Finished difference Result 3089 states and 4371 transitions. [2019-11-15 20:43:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:26,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-11-15 20:43:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:26,101 INFO L225 Difference]: With dead ends: 3089 [2019-11-15 20:43:26,101 INFO L226 Difference]: Without dead ends: 1512 [2019-11-15 20:43:26,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:43:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-11-15 20:43:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1386. [2019-11-15 20:43:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-11-15 20:43:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1947 transitions. [2019-11-15 20:43:26,137 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1947 transitions. Word has length 198 [2019-11-15 20:43:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:26,138 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 1947 transitions. [2019-11-15 20:43:26,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1947 transitions. [2019-11-15 20:43:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 20:43:26,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:26,140 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-11-15 20:43:26,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:26,340 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash -940906886, now seen corresponding path program 1 times [2019-11-15 20:43:26,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:26,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430100250] [2019-11-15 20:43:26,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:26,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:26,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 20:43:26,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430100250] [2019-11-15 20:43:26,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:26,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:26,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854418208] [2019-11-15 20:43:26,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:26,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:26,466 INFO L87 Difference]: Start difference. First operand 1386 states and 1947 transitions. Second operand 4 states. [2019-11-15 20:43:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:26,851 INFO L93 Difference]: Finished difference Result 3174 states and 4479 transitions. [2019-11-15 20:43:26,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:26,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 20:43:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:26,854 INFO L225 Difference]: With dead ends: 3174 [2019-11-15 20:43:26,854 INFO L226 Difference]: Without dead ends: 1798 [2019-11-15 20:43:26,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-15 20:43:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-11-15 20:43:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1491. [2019-11-15 20:43:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-15 20:43:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2092 transitions. [2019-11-15 20:43:26,900 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2092 transitions. Word has length 201 [2019-11-15 20:43:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:26,901 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 2092 transitions. [2019-11-15 20:43:26,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2092 transitions. [2019-11-15 20:43:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 20:43:26,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:26,904 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-11-15 20:43:26,904 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1672874312, now seen corresponding path program 1 times [2019-11-15 20:43:26,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:26,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890353760] [2019-11-15 20:43:26,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:26,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:26,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 20:43:27,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890353760] [2019-11-15 20:43:27,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:27,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:27,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641114924] [2019-11-15 20:43:27,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:27,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:27,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:27,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:27,028 INFO L87 Difference]: Start difference. First operand 1491 states and 2092 transitions. Second operand 4 states. [2019-11-15 20:43:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:27,460 INFO L93 Difference]: Finished difference Result 3379 states and 4764 transitions. [2019-11-15 20:43:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:27,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 20:43:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:27,462 INFO L225 Difference]: With dead ends: 3379 [2019-11-15 20:43:27,462 INFO L226 Difference]: Without dead ends: 1898 [2019-11-15 20:43:27,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-15 20:43:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1486. [2019-11-15 20:43:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2019-11-15 20:43:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2087 transitions. [2019-11-15 20:43:27,510 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2087 transitions. Word has length 201 [2019-11-15 20:43:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:27,510 INFO L462 AbstractCegarLoop]: Abstraction has 1486 states and 2087 transitions. [2019-11-15 20:43:27,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2087 transitions. [2019-11-15 20:43:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 20:43:27,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:27,514 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 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] [2019-11-15 20:43:27,514 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 119071787, now seen corresponding path program 1 times [2019-11-15 20:43:27,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:27,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136249544] [2019-11-15 20:43:27,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:27,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:27,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 20:43:27,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136249544] [2019-11-15 20:43:27,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:27,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:27,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928944134] [2019-11-15 20:43:27,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:27,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:27,714 INFO L87 Difference]: Start difference. First operand 1486 states and 2087 transitions. Second operand 4 states. [2019-11-15 20:43:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:28,119 INFO L93 Difference]: Finished difference Result 3344 states and 4713 transitions. [2019-11-15 20:43:28,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:28,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 20:43:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:28,121 INFO L225 Difference]: With dead ends: 3344 [2019-11-15 20:43:28,121 INFO L226 Difference]: Without dead ends: 1868 [2019-11-15 20:43:28,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2019-11-15 20:43:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1586. [2019-11-15 20:43:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-15 20:43:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2227 transitions. [2019-11-15 20:43:28,168 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2227 transitions. Word has length 202 [2019-11-15 20:43:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:28,169 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2227 transitions. [2019-11-15 20:43:28,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2227 transitions. [2019-11-15 20:43:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 20:43:28,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:28,172 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 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] [2019-11-15 20:43:28,172 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:28,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1097081939, now seen corresponding path program 1 times [2019-11-15 20:43:28,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:28,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291035065] [2019-11-15 20:43:28,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:28,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:28,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 20:43:28,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291035065] [2019-11-15 20:43:28,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:28,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:28,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700478649] [2019-11-15 20:43:28,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:28,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:28,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:28,292 INFO L87 Difference]: Start difference. First operand 1586 states and 2227 transitions. Second operand 4 states. [2019-11-15 20:43:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:28,923 INFO L93 Difference]: Finished difference Result 3439 states and 4848 transitions. [2019-11-15 20:43:28,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:28,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 20:43:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:28,926 INFO L225 Difference]: With dead ends: 3439 [2019-11-15 20:43:28,926 INFO L226 Difference]: Without dead ends: 1863 [2019-11-15 20:43:28,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2019-11-15 20:43:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1481. [2019-11-15 20:43:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-15 20:43:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2082 transitions. [2019-11-15 20:43:28,982 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2082 transitions. Word has length 202 [2019-11-15 20:43:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:28,983 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2082 transitions. [2019-11-15 20:43:28,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2082 transitions. [2019-11-15 20:43:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 20:43:28,986 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:28,986 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:28,986 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash 547333609, now seen corresponding path program 1 times [2019-11-15 20:43:28,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:28,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643625197] [2019-11-15 20:43:28,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:28,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:28,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 20:43:29,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643625197] [2019-11-15 20:43:29,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:29,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:29,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648113544] [2019-11-15 20:43:29,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:29,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:29,096 INFO L87 Difference]: Start difference. First operand 1481 states and 2082 transitions. Second operand 4 states. [2019-11-15 20:43:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:29,510 INFO L93 Difference]: Finished difference Result 3034 states and 4255 transitions. [2019-11-15 20:43:29,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:29,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-15 20:43:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:29,512 INFO L225 Difference]: With dead ends: 3034 [2019-11-15 20:43:29,512 INFO L226 Difference]: Without dead ends: 1563 [2019-11-15 20:43:29,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-15 20:43:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1516. [2019-11-15 20:43:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-15 20:43:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2127 transitions. [2019-11-15 20:43:29,551 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2127 transitions. Word has length 207 [2019-11-15 20:43:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:29,551 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 2127 transitions. [2019-11-15 20:43:29,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2127 transitions. [2019-11-15 20:43:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 20:43:29,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:29,553 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:29,553 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash -834399056, now seen corresponding path program 1 times [2019-11-15 20:43:29,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:29,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837322524] [2019-11-15 20:43:29,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:29,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:29,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 20:43:29,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837322524] [2019-11-15 20:43:29,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:29,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:29,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402019144] [2019-11-15 20:43:29,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:29,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:29,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:29,685 INFO L87 Difference]: Start difference. First operand 1516 states and 2127 transitions. Second operand 4 states. [2019-11-15 20:43:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:30,261 INFO L93 Difference]: Finished difference Result 3404 states and 4788 transitions. [2019-11-15 20:43:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:30,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-11-15 20:43:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:30,263 INFO L225 Difference]: With dead ends: 3404 [2019-11-15 20:43:30,264 INFO L226 Difference]: Without dead ends: 1898 [2019-11-15 20:43:30,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-15 20:43:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1611. [2019-11-15 20:43:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-11-15 20:43:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2252 transitions. [2019-11-15 20:43:30,315 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2252 transitions. Word has length 219 [2019-11-15 20:43:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:30,315 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 2252 transitions. [2019-11-15 20:43:30,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2252 transitions. [2019-11-15 20:43:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 20:43:30,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:30,318 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:30,319 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1581437294, now seen corresponding path program 1 times [2019-11-15 20:43:30,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:30,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020413796] [2019-11-15 20:43:30,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:30,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:30,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 20:43:30,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020413796] [2019-11-15 20:43:30,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:30,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:30,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604143970] [2019-11-15 20:43:30,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:30,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:30,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:30,441 INFO L87 Difference]: Start difference. First operand 1611 states and 2252 transitions. Second operand 4 states. [2019-11-15 20:43:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:30,820 INFO L93 Difference]: Finished difference Result 3499 states and 4908 transitions. [2019-11-15 20:43:30,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:30,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-11-15 20:43:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:30,822 INFO L225 Difference]: With dead ends: 3499 [2019-11-15 20:43:30,822 INFO L226 Difference]: Without dead ends: 1898 [2019-11-15 20:43:30,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-15 20:43:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1516. [2019-11-15 20:43:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-15 20:43:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2122 transitions. [2019-11-15 20:43:30,860 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2122 transitions. Word has length 219 [2019-11-15 20:43:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:30,860 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 2122 transitions. [2019-11-15 20:43:30,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2122 transitions. [2019-11-15 20:43:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-15 20:43:30,862 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:30,862 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 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-15 20:43:30,862 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1289530561, now seen corresponding path program 1 times [2019-11-15 20:43:30,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:30,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094785994] [2019-11-15 20:43:30,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:30,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:30,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 20:43:30,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094785994] [2019-11-15 20:43:30,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:30,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:30,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384050814] [2019-11-15 20:43:30,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:30,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:30,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:30,987 INFO L87 Difference]: Start difference. First operand 1516 states and 2122 transitions. Second operand 4 states. [2019-11-15 20:43:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:31,394 INFO L93 Difference]: Finished difference Result 3384 states and 4744 transitions. [2019-11-15 20:43:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:31,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-15 20:43:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:31,396 INFO L225 Difference]: With dead ends: 3384 [2019-11-15 20:43:31,396 INFO L226 Difference]: Without dead ends: 1878 [2019-11-15 20:43:31,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-11-15 20:43:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1616. [2019-11-15 20:43:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2019-11-15 20:43:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2252 transitions. [2019-11-15 20:43:31,464 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2252 transitions. Word has length 220 [2019-11-15 20:43:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:31,465 INFO L462 AbstractCegarLoop]: Abstraction has 1616 states and 2252 transitions. [2019-11-15 20:43:31,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2252 transitions. [2019-11-15 20:43:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-15 20:43:31,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:31,467 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 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-15 20:43:31,467 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:31,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1128953917, now seen corresponding path program 1 times [2019-11-15 20:43:31,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:31,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696555708] [2019-11-15 20:43:31,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:31,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:31,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 20:43:31,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696555708] [2019-11-15 20:43:31,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:31,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:31,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274104428] [2019-11-15 20:43:31,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:31,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:31,569 INFO L87 Difference]: Start difference. First operand 1616 states and 2252 transitions. Second operand 4 states. [2019-11-15 20:43:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:31,924 INFO L93 Difference]: Finished difference Result 3484 states and 4869 transitions. [2019-11-15 20:43:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:31,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-15 20:43:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:31,927 INFO L225 Difference]: With dead ends: 3484 [2019-11-15 20:43:31,927 INFO L226 Difference]: Without dead ends: 1878 [2019-11-15 20:43:31,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-11-15 20:43:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1516. [2019-11-15 20:43:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-15 20:43:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2117 transitions. [2019-11-15 20:43:31,962 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2117 transitions. Word has length 220 [2019-11-15 20:43:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:31,963 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 2117 transitions. [2019-11-15 20:43:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2117 transitions. [2019-11-15 20:43:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 20:43:31,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:31,965 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:31,965 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2087148855, now seen corresponding path program 1 times [2019-11-15 20:43:31,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:31,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507213681] [2019-11-15 20:43:31,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:31,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:31,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 20:43:32,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507213681] [2019-11-15 20:43:32,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:32,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:32,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492640444] [2019-11-15 20:43:32,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:32,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:32,087 INFO L87 Difference]: Start difference. First operand 1516 states and 2117 transitions. Second operand 4 states. [2019-11-15 20:43:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:32,504 INFO L93 Difference]: Finished difference Result 3239 states and 4504 transitions. [2019-11-15 20:43:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:32,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 20:43:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:32,506 INFO L225 Difference]: With dead ends: 3239 [2019-11-15 20:43:32,507 INFO L226 Difference]: Without dead ends: 1733 [2019-11-15 20:43:32,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2019-11-15 20:43:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1661. [2019-11-15 20:43:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2019-11-15 20:43:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2312 transitions. [2019-11-15 20:43:32,564 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2312 transitions. Word has length 232 [2019-11-15 20:43:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:32,564 INFO L462 AbstractCegarLoop]: Abstraction has 1661 states and 2312 transitions. [2019-11-15 20:43:32,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2312 transitions. [2019-11-15 20:43:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 20:43:32,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:32,568 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:32,568 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash -486077749, now seen corresponding path program 1 times [2019-11-15 20:43:32,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:32,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15273633] [2019-11-15 20:43:32,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:32,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:32,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-11-15 20:43:32,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15273633] [2019-11-15 20:43:32,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:32,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:32,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546521351] [2019-11-15 20:43:32,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:32,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:32,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:32,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:32,706 INFO L87 Difference]: Start difference. First operand 1661 states and 2312 transitions. Second operand 4 states. [2019-11-15 20:43:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:33,141 INFO L93 Difference]: Finished difference Result 3724 states and 5209 transitions. [2019-11-15 20:43:33,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:33,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 20:43:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:33,145 INFO L225 Difference]: With dead ends: 3724 [2019-11-15 20:43:33,145 INFO L226 Difference]: Without dead ends: 2073 [2019-11-15 20:43:33,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-11-15 20:43:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1766. [2019-11-15 20:43:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-11-15 20:43:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2457 transitions. [2019-11-15 20:43:33,184 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2457 transitions. Word has length 232 [2019-11-15 20:43:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:33,184 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 2457 transitions. [2019-11-15 20:43:33,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2457 transitions. [2019-11-15 20:43:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 20:43:33,186 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:33,187 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:33,187 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:33,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:33,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1218045175, now seen corresponding path program 1 times [2019-11-15 20:43:33,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:33,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662705550] [2019-11-15 20:43:33,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:33,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:33,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-11-15 20:43:33,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662705550] [2019-11-15 20:43:33,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:33,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:33,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062828648] [2019-11-15 20:43:33,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:33,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:33,386 INFO L87 Difference]: Start difference. First operand 1766 states and 2457 transitions. Second operand 4 states. [2019-11-15 20:43:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:33,986 INFO L93 Difference]: Finished difference Result 3934 states and 5499 transitions. [2019-11-15 20:43:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:33,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 20:43:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:33,989 INFO L225 Difference]: With dead ends: 3934 [2019-11-15 20:43:33,989 INFO L226 Difference]: Without dead ends: 2178 [2019-11-15 20:43:33,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-11-15 20:43:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1766. [2019-11-15 20:43:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-11-15 20:43:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2457 transitions. [2019-11-15 20:43:34,051 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2457 transitions. Word has length 232 [2019-11-15 20:43:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:34,052 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 2457 transitions. [2019-11-15 20:43:34,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2457 transitions. [2019-11-15 20:43:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 20:43:34,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:34,056 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:34,056 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1333873146, now seen corresponding path program 1 times [2019-11-15 20:43:34,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:34,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601420011] [2019-11-15 20:43:34,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:34,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-11-15 20:43:34,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601420011] [2019-11-15 20:43:34,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:34,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:34,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23529440] [2019-11-15 20:43:34,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:34,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:34,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:34,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:34,206 INFO L87 Difference]: Start difference. First operand 1766 states and 2457 transitions. Second operand 4 states. [2019-11-15 20:43:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:34,809 INFO L93 Difference]: Finished difference Result 3904 states and 5453 transitions. [2019-11-15 20:43:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:34,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 20:43:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:34,812 INFO L225 Difference]: With dead ends: 3904 [2019-11-15 20:43:34,812 INFO L226 Difference]: Without dead ends: 2148 [2019-11-15 20:43:34,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-15 20:43:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1866. [2019-11-15 20:43:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2019-11-15 20:43:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2597 transitions. [2019-11-15 20:43:34,865 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2597 transitions. Word has length 233 [2019-11-15 20:43:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:34,866 INFO L462 AbstractCegarLoop]: Abstraction has 1866 states and 2597 transitions. [2019-11-15 20:43:34,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2597 transitions. [2019-11-15 20:43:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 20:43:34,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:34,869 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:34,869 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash 117719420, now seen corresponding path program 1 times [2019-11-15 20:43:34,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:34,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495835949] [2019-11-15 20:43:34,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:34,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:34,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-11-15 20:43:35,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495835949] [2019-11-15 20:43:35,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:35,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:35,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165370052] [2019-11-15 20:43:35,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:35,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:35,080 INFO L87 Difference]: Start difference. First operand 1866 states and 2597 transitions. Second operand 4 states. [2019-11-15 20:43:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:35,731 INFO L93 Difference]: Finished difference Result 3999 states and 5588 transitions. [2019-11-15 20:43:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:35,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 20:43:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:35,733 INFO L225 Difference]: With dead ends: 3999 [2019-11-15 20:43:35,733 INFO L226 Difference]: Without dead ends: 2143 [2019-11-15 20:43:35,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-11-15 20:43:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1761. [2019-11-15 20:43:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-11-15 20:43:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2452 transitions. [2019-11-15 20:43:35,774 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2452 transitions. Word has length 233 [2019-11-15 20:43:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:35,774 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2452 transitions. [2019-11-15 20:43:35,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2452 transitions. [2019-11-15 20:43:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 20:43:35,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:35,777 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:35,777 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:35,777 INFO L82 PathProgramCache]: Analyzing trace with hash 591869733, now seen corresponding path program 1 times [2019-11-15 20:43:35,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:35,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039990422] [2019-11-15 20:43:35,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:35,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:35,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-11-15 20:43:35,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039990422] [2019-11-15 20:43:35,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:35,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:35,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930093786] [2019-11-15 20:43:35,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:35,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:35,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:35,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:35,900 INFO L87 Difference]: Start difference. First operand 1761 states and 2452 transitions. Second operand 4 states. [2019-11-15 20:43:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:36,185 INFO L93 Difference]: Finished difference Result 3242 states and 4501 transitions. [2019-11-15 20:43:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:36,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-11-15 20:43:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:36,187 INFO L225 Difference]: With dead ends: 3242 [2019-11-15 20:43:36,187 INFO L226 Difference]: Without dead ends: 1818 [2019-11-15 20:43:36,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-11-15 20:43:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1761. [2019-11-15 20:43:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-11-15 20:43:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2447 transitions. [2019-11-15 20:43:36,227 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2447 transitions. Word has length 235 [2019-11-15 20:43:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:36,227 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2447 transitions. [2019-11-15 20:43:36,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2447 transitions. [2019-11-15 20:43:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 20:43:36,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:36,228 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:36,229 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1805600797, now seen corresponding path program 1 times [2019-11-15 20:43:36,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:36,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304738477] [2019-11-15 20:43:36,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:36,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:36,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-11-15 20:43:36,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304738477] [2019-11-15 20:43:36,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:36,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:36,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052475264] [2019-11-15 20:43:36,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:36,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:36,360 INFO L87 Difference]: Start difference. First operand 1761 states and 2447 transitions. Second operand 4 states. [2019-11-15 20:43:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:36,719 INFO L93 Difference]: Finished difference Result 3432 states and 4787 transitions. [2019-11-15 20:43:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:36,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-11-15 20:43:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:36,721 INFO L225 Difference]: With dead ends: 3432 [2019-11-15 20:43:36,721 INFO L226 Difference]: Without dead ends: 2008 [2019-11-15 20:43:36,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-15 20:43:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1761. [2019-11-15 20:43:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-11-15 20:43:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2442 transitions. [2019-11-15 20:43:36,761 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2442 transitions. Word has length 235 [2019-11-15 20:43:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:36,761 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2442 transitions. [2019-11-15 20:43:36,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2442 transitions. [2019-11-15 20:43:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-15 20:43:36,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:36,763 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:36,763 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1733034762, now seen corresponding path program 1 times [2019-11-15 20:43:36,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:36,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374469820] [2019-11-15 20:43:36,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:36,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:36,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 20:43:36,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374469820] [2019-11-15 20:43:36,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:36,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:36,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060487750] [2019-11-15 20:43:36,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:36,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:36,893 INFO L87 Difference]: Start difference. First operand 1761 states and 2442 transitions. Second operand 4 states. [2019-11-15 20:43:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:37,197 INFO L93 Difference]: Finished difference Result 3649 states and 5065 transitions. [2019-11-15 20:43:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:37,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-15 20:43:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:37,199 INFO L225 Difference]: With dead ends: 3649 [2019-11-15 20:43:37,200 INFO L226 Difference]: Without dead ends: 1898 [2019-11-15 20:43:37,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-15 20:43:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1826. [2019-11-15 20:43:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-15 20:43:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2547 transitions. [2019-11-15 20:43:37,245 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2547 transitions. Word has length 237 [2019-11-15 20:43:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:37,245 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2547 transitions. [2019-11-15 20:43:37,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2547 transitions. [2019-11-15 20:43:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-15 20:43:37,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:37,247 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:37,247 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash -486005055, now seen corresponding path program 1 times [2019-11-15 20:43:37,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:37,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094156015] [2019-11-15 20:43:37,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:37,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:37,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-15 20:43:37,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094156015] [2019-11-15 20:43:37,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:37,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:37,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515409298] [2019-11-15 20:43:37,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:37,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:37,389 INFO L87 Difference]: Start difference. First operand 1826 states and 2547 transitions. Second operand 4 states. [2019-11-15 20:43:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:37,750 INFO L93 Difference]: Finished difference Result 4024 states and 5628 transitions. [2019-11-15 20:43:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:37,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-11-15 20:43:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:37,752 INFO L225 Difference]: With dead ends: 4024 [2019-11-15 20:43:37,752 INFO L226 Difference]: Without dead ends: 2208 [2019-11-15 20:43:37,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-11-15 20:43:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1921. [2019-11-15 20:43:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-11-15 20:43:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2672 transitions. [2019-11-15 20:43:37,795 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2672 transitions. Word has length 250 [2019-11-15 20:43:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:37,796 INFO L462 AbstractCegarLoop]: Abstraction has 1921 states and 2672 transitions. [2019-11-15 20:43:37,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2672 transitions. [2019-11-15 20:43:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-15 20:43:37,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:37,797 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:37,798 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:37,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1929831295, now seen corresponding path program 1 times [2019-11-15 20:43:37,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:37,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650528856] [2019-11-15 20:43:37,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:37,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:37,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-15 20:43:37,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650528856] [2019-11-15 20:43:37,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:37,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:37,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595047336] [2019-11-15 20:43:37,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:37,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:37,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:37,945 INFO L87 Difference]: Start difference. First operand 1921 states and 2672 transitions. Second operand 4 states. [2019-11-15 20:43:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:38,351 INFO L93 Difference]: Finished difference Result 4119 states and 5748 transitions. [2019-11-15 20:43:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:38,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-11-15 20:43:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:38,354 INFO L225 Difference]: With dead ends: 4119 [2019-11-15 20:43:38,354 INFO L226 Difference]: Without dead ends: 2208 [2019-11-15 20:43:38,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-15 20:43:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-11-15 20:43:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1826. [2019-11-15 20:43:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-15 20:43:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2542 transitions. [2019-11-15 20:43:38,408 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2542 transitions. Word has length 250 [2019-11-15 20:43:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:38,408 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2542 transitions. [2019-11-15 20:43:38,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2542 transitions. [2019-11-15 20:43:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-15 20:43:38,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:38,410 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:38,410 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash -795157296, now seen corresponding path program 1 times [2019-11-15 20:43:38,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:38,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39195120] [2019-11-15 20:43:38,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:38,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:38,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-15 20:43:38,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39195120] [2019-11-15 20:43:38,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:38,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:38,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865659517] [2019-11-15 20:43:38,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:38,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:38,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:38,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:38,601 INFO L87 Difference]: Start difference. First operand 1826 states and 2542 transitions. Second operand 4 states. [2019-11-15 20:43:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:39,060 INFO L93 Difference]: Finished difference Result 4004 states and 5584 transitions. [2019-11-15 20:43:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:39,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-11-15 20:43:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:39,062 INFO L225 Difference]: With dead ends: 4004 [2019-11-15 20:43:39,063 INFO L226 Difference]: Without dead ends: 2188 [2019-11-15 20:43:39,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2019-11-15 20:43:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 1926. [2019-11-15 20:43:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-11-15 20:43:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2672 transitions. [2019-11-15 20:43:39,111 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2672 transitions. Word has length 251 [2019-11-15 20:43:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:39,111 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2672 transitions. [2019-11-15 20:43:39,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2672 transitions. [2019-11-15 20:43:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-15 20:43:39,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:39,113 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:39,113 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1081325522, now seen corresponding path program 1 times [2019-11-15 20:43:39,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:39,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993200177] [2019-11-15 20:43:39,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:39,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:39,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-15 20:43:39,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993200177] [2019-11-15 20:43:39,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:39,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:39,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416115187] [2019-11-15 20:43:39,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:39,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:39,274 INFO L87 Difference]: Start difference. First operand 1926 states and 2672 transitions. Second operand 4 states. [2019-11-15 20:43:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:39,683 INFO L93 Difference]: Finished difference Result 4104 states and 5709 transitions. [2019-11-15 20:43:39,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:39,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-11-15 20:43:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:39,685 INFO L225 Difference]: With dead ends: 4104 [2019-11-15 20:43:39,685 INFO L226 Difference]: Without dead ends: 2188 [2019-11-15 20:43:39,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2019-11-15 20:43:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 1826. [2019-11-15 20:43:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-15 20:43:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2537 transitions. [2019-11-15 20:43:39,735 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2537 transitions. Word has length 251 [2019-11-15 20:43:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:39,736 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2537 transitions. [2019-11-15 20:43:39,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2537 transitions. [2019-11-15 20:43:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-15 20:43:39,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:39,738 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:39,738 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2096039734, now seen corresponding path program 1 times [2019-11-15 20:43:39,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:39,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25347330] [2019-11-15 20:43:39,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:39,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:39,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-11-15 20:43:39,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25347330] [2019-11-15 20:43:39,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:39,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:39,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752741883] [2019-11-15 20:43:39,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:39,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:39,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:39,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:39,877 INFO L87 Difference]: Start difference. First operand 1826 states and 2537 transitions. Second operand 4 states. [2019-11-15 20:43:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:40,291 INFO L93 Difference]: Finished difference Result 3649 states and 5079 transitions. [2019-11-15 20:43:40,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:40,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-15 20:43:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:40,293 INFO L225 Difference]: With dead ends: 3649 [2019-11-15 20:43:40,293 INFO L226 Difference]: Without dead ends: 2173 [2019-11-15 20:43:40,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-11-15 20:43:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1916. [2019-11-15 20:43:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-11-15 20:43:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2652 transitions. [2019-11-15 20:43:40,341 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2652 transitions. Word has length 266 [2019-11-15 20:43:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:40,341 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 2652 transitions. [2019-11-15 20:43:40,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2652 transitions. [2019-11-15 20:43:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-15 20:43:40,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:40,343 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:40,343 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -301430796, now seen corresponding path program 1 times [2019-11-15 20:43:40,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:40,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115795703] [2019-11-15 20:43:40,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:40,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:40,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-11-15 20:43:40,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115795703] [2019-11-15 20:43:40,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:40,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:40,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987044025] [2019-11-15 20:43:40,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:40,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:40,523 INFO L87 Difference]: Start difference. First operand 1916 states and 2652 transitions. Second operand 4 states. [2019-11-15 20:43:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:40,909 INFO L93 Difference]: Finished difference Result 3721 states and 5166 transitions. [2019-11-15 20:43:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:40,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-15 20:43:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:40,911 INFO L225 Difference]: With dead ends: 3721 [2019-11-15 20:43:40,911 INFO L226 Difference]: Without dead ends: 2173 [2019-11-15 20:43:40,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-11-15 20:43:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1826. [2019-11-15 20:43:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-15 20:43:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2532 transitions. [2019-11-15 20:43:40,969 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2532 transitions. Word has length 266 [2019-11-15 20:43:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:40,970 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2532 transitions. [2019-11-15 20:43:40,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2532 transitions. [2019-11-15 20:43:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 20:43:40,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:40,972 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:40,972 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1762933879, now seen corresponding path program 1 times [2019-11-15 20:43:40,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:40,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993176550] [2019-11-15 20:43:40,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:40,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-15 20:43:41,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993176550] [2019-11-15 20:43:41,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:41,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:41,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333802934] [2019-11-15 20:43:41,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:41,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:41,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:41,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:41,102 INFO L87 Difference]: Start difference. First operand 1826 states and 2532 transitions. Second operand 4 states. [2019-11-15 20:43:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:41,447 INFO L93 Difference]: Finished difference Result 3899 states and 5400 transitions. [2019-11-15 20:43:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:41,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-15 20:43:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:41,449 INFO L225 Difference]: With dead ends: 3899 [2019-11-15 20:43:41,450 INFO L226 Difference]: Without dead ends: 2083 [2019-11-15 20:43:41,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-15 20:43:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2001. [2019-11-15 20:43:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-11-15 20:43:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2782 transitions. [2019-11-15 20:43:41,502 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2782 transitions. Word has length 268 [2019-11-15 20:43:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:41,502 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 2782 transitions. [2019-11-15 20:43:41,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2782 transitions. [2019-11-15 20:43:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 20:43:41,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:41,504 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:41,504 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash 665324743, now seen corresponding path program 1 times [2019-11-15 20:43:41,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:41,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121364625] [2019-11-15 20:43:41,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:41,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:41,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 303 proven. 334 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-15 20:43:43,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121364625] [2019-11-15 20:43:43,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731371619] [2019-11-15 20:43:43,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 20:43:44,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:44,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-15 20:43:44,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,276 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_160|], 2=[|v_#memory_$Pointer$.base_148|, |v_#memory_$Pointer$.base_147|, |v_#memory_$Pointer$.base_146|]} [2019-11-15 20:43:44,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 20:43:44,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-11-15 20:43:44,408 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:43:44,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 20:43:44,456 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,527 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 20:43:44,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 20:43:44,528 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,544 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:121, output treesize:79 [2019-11-15 20:43:44,604 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 20:43:44,604 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 98 treesize of output 52 [2019-11-15 20:43:44,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:43:44,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-15 20:43:44,622 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_146|], 2=[|v_#memory_$Pointer$.base_150|], 6=[|v_#memory_$Pointer$.base_149|], 12=[|v_#memory_$Pointer$.base_162|]} [2019-11-15 20:43:44,627 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-15 20:43:44,627 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:43:44,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,661 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-15 20:43:44,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,689 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:43:44,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:43:44,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:44,913 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) 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) Caused by: 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.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.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) ... 21 more [2019-11-15 20:43:44,916 INFO L168 Benchmark]: Toolchain (without parser) took 62591.34 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -584.2 MB). Peak memory consumption was 588.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:44,917 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:43:44,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:44,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:43:44,917 INFO L168 Benchmark]: Boogie Preprocessor took 134.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:44,918 INFO L168 Benchmark]: RCFGBuilder took 1228.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:44,918 INFO L168 Benchmark]: TraceAbstraction took 60288.02 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 977.6 MB in the beginning and 1.5 GB in the end (delta: -551.4 MB). Peak memory consumption was 510.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:44,920 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.56 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 827.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1228.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60288.02 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 977.6 MB in the beginning and 1.5 GB in the end (delta: -551.4 MB). Peak memory consumption was 510.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) 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-15 20:43:47,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:43:47,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:43:47,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:43:47,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:43:47,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:43:47,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:43:47,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:43:47,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:43:47,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:43:47,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:43:47,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:43:47,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:43:47,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:43:47,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:43:47,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:43:47,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:43:47,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:43:47,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:43:47,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:43:47,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:43:47,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:43:47,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:43:47,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:43:47,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:43:47,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:43:47,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:43:47,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:43:47,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:43:47,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:43:47,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:43:47,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:43:47,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:43:47,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:43:47,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:43:47,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:43:47,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:43:47,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:43:47,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:43:47,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:43:47,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:43:47,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:43:47,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:43:47,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:43:47,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:43:47,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:43:47,341 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:43:47,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:43:47,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:43:47,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:43:47,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:43:47,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:43:47,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:43:47,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:43:47,344 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:43:47,345 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:43:47,345 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:43:47,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:43:47,346 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:43:47,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:43:47,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:43:47,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:43:47,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:43:47,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:43:47,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:43:47,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:43:47,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:43:47,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:43:47,349 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:43:47,349 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:43:47,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:43:47,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:43:47,350 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_371502cb-8205-42ed-96db-e69a8f07c2c0/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 -> e017d7bcecd9326dc3a012dec9b0fc34b9541a8f [2019-11-15 20:43:47,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:43:47,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:43:47,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:43:47,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:43:47,436 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:43:47,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c [2019-11-15 20:43:47,492 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/c6133908e/05bbedb351ae4642b6b7e2941c7ac21b/FLAG0d619ab42 [2019-11-15 20:43:48,075 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:43:48,076 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-2.c [2019-11-15 20:43:48,100 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/c6133908e/05bbedb351ae4642b6b7e2941c7ac21b/FLAG0d619ab42 [2019-11-15 20:43:48,317 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/data/c6133908e/05bbedb351ae4642b6b7e2941c7ac21b [2019-11-15 20:43:48,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:43:48,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:43:48,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:43:48,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:43:48,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:43:48,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:43:48" (1/1) ... [2019-11-15 20:43:48,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3afbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:48, skipping insertion in model container [2019-11-15 20:43:48,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:43:48" (1/1) ... [2019-11-15 20:43:48,338 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:43:48,411 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:43:49,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:43:49,083 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:43:49,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:43:49,297 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:43:49,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49 WrapperNode [2019-11-15 20:43:49,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:43:49,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:43:49,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:43:49,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:43:49,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:43:49,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:43:49,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:43:49,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:43:49,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... [2019-11-15 20:43:49,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:43:49,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:43:49,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:43:49,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:43:49,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:43:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:43:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:43:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:43:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:43:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:43:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:43:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:43:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:43:49,994 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:43:54,831 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 20:43:54,832 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 20:43:54,833 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:43:54,833 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:43:54,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:54 BoogieIcfgContainer [2019-11-15 20:43:54,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:43:54,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:43:54,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:43:54,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:43:54,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:43:48" (1/3) ... [2019-11-15 20:43:54,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f22272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:43:54, skipping insertion in model container [2019-11-15 20:43:54,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:49" (2/3) ... [2019-11-15 20:43:54,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f22272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:43:54, skipping insertion in model container [2019-11-15 20:43:54,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:54" (3/3) ... [2019-11-15 20:43:54,845 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2019-11-15 20:43:54,855 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:43:54,864 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:43:54,876 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:43:54,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:43:54,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:43:54,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:43:54,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:43:54,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:43:54,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:43:54,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:43:54,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:43:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 20:43:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:43:54,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:54,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:54,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-15 20:43:54,954 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:43:54,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1987737320] [2019-11-15 20:43:54,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:43:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:55,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:55,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:55,244 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:43:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:55,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1987737320] [2019-11-15 20:43:55,266 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:55,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:43:55,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301638972] [2019-11-15 20:43:55,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:55,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:43:55,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:55,293 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 20:43:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:55,492 INFO L93 Difference]: Finished difference Result 488 states and 825 transitions. [2019-11-15 20:43:55,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:55,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 20:43:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:55,529 INFO L225 Difference]: With dead ends: 488 [2019-11-15 20:43:55,534 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 20:43:55,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 20:43:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 20:43:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 20:43:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 472 transitions. [2019-11-15 20:43:55,626 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 472 transitions. Word has length 24 [2019-11-15 20:43:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:55,627 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 472 transitions. [2019-11-15 20:43:55,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 472 transitions. [2019-11-15 20:43:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:43:55,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:55,632 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:43:55,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:43:55,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash -919689487, now seen corresponding path program 1 times [2019-11-15 20:43:55,836 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:43:55,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [977526290] [2019-11-15 20:43:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:43:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:56,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:56,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:56,108 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-15 20:43:56,108 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:43:56,133 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-15 20:43:56,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [977526290] [2019-11-15 20:43:56,134 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:56,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:43:56,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391188896] [2019-11-15 20:43:56,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:56,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:43:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:56,138 INFO L87 Difference]: Start difference. First operand 315 states and 472 transitions. Second operand 4 states. [2019-11-15 20:43:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:57,253 INFO L93 Difference]: Finished difference Result 724 states and 1092 transitions. [2019-11-15 20:43:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:57,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:43:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:57,259 INFO L225 Difference]: With dead ends: 724 [2019-11-15 20:43:57,259 INFO L226 Difference]: Without dead ends: 517 [2019-11-15 20:43:57,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-11-15 20:43:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2019-11-15 20:43:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-15 20:43:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 772 transitions. [2019-11-15 20:43:57,324 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 772 transitions. Word has length 60 [2019-11-15 20:43:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:57,325 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 772 transitions. [2019-11-15 20:43:57,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 772 transitions. [2019-11-15 20:43:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:43:57,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:57,342 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-11-15 20:43:57,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:43:57,545 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -874096830, now seen corresponding path program 1 times [2019-11-15 20:43:57,547 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:43:57,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [53396624] [2019-11-15 20:43:57,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:43:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:57,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 20:43:57,834 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:43:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 20:43:57,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [53396624] [2019-11-15 20:43:57,864 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:57,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:43:57,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512820612] [2019-11-15 20:43:57,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:57,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:43:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:57,867 INFO L87 Difference]: Start difference. First operand 517 states and 772 transitions. Second operand 4 states. [2019-11-15 20:43:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:59,215 INFO L93 Difference]: Finished difference Result 1128 states and 1691 transitions. [2019-11-15 20:43:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:43:59,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:43:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:59,223 INFO L225 Difference]: With dead ends: 1128 [2019-11-15 20:43:59,223 INFO L226 Difference]: Without dead ends: 719 [2019-11-15 20:43:59,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-11-15 20:43:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2019-11-15 20:43:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-15 20:43:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1071 transitions. [2019-11-15 20:43:59,268 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1071 transitions. Word has length 99 [2019-11-15 20:43:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:59,270 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1071 transitions. [2019-11-15 20:43:59,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1071 transitions. [2019-11-15 20:43:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 20:43:59,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:59,277 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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-15 20:43:59,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:43:59,481 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1561396444, now seen corresponding path program 1 times [2019-11-15 20:43:59,482 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:43:59,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2014280834] [2019-11-15 20:43:59,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:01,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:01,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:01,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:01,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:01,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:01,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:01,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:01,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:01,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:01,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:01,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:01,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:01,753 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-15 20:44:01,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:44:01,805 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:01,844 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 18 [2019-11-15 20:44:01,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:01,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:01,852 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:01,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:01,853 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-15 20:44:01,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:44:01,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2014280834] [2019-11-15 20:44:01,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:44:01,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:44:01,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624972706] [2019-11-15 20:44:01,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:01,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:01,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:01,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:01,878 INFO L87 Difference]: Start difference. First operand 719 states and 1071 transitions. Second operand 4 states. [2019-11-15 20:44:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:05,759 INFO L93 Difference]: Finished difference Result 2068 states and 3089 transitions. [2019-11-15 20:44:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:05,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-15 20:44:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:05,771 INFO L225 Difference]: With dead ends: 2068 [2019-11-15 20:44:05,772 INFO L226 Difference]: Without dead ends: 1356 [2019-11-15 20:44:05,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-11-15 20:44:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 865. [2019-11-15 20:44:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-11-15 20:44:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1315 transitions. [2019-11-15 20:44:05,819 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1315 transitions. Word has length 119 [2019-11-15 20:44:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:05,820 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1315 transitions. [2019-11-15 20:44:05,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1315 transitions. [2019-11-15 20:44:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 20:44:05,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:05,828 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:06,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:06,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1423411067, now seen corresponding path program 1 times [2019-11-15 20:44:06,040 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:44:06,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1471108148] [2019-11-15 20:44:06,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:08,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:08,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:08,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:08,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:08,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:08,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:08,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:08,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:08,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:08,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:08,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:08,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:08,285 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-15 20:44:08,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 125 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:44:08,322 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:08,369 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 18 [2019-11-15 20:44:08,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:08,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:08,373 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:08,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:08,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-15 20:44:08,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 20:44:08,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1471108148] [2019-11-15 20:44:08,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:44:08,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:44:08,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394712634] [2019-11-15 20:44:08,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:08,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:08,395 INFO L87 Difference]: Start difference. First operand 865 states and 1315 transitions. Second operand 4 states. [2019-11-15 20:44:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:13,617 INFO L93 Difference]: Finished difference Result 2328 states and 3529 transitions. [2019-11-15 20:44:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:13,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 20:44:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:13,632 INFO L225 Difference]: With dead ends: 2328 [2019-11-15 20:44:13,633 INFO L226 Difference]: Without dead ends: 1470 [2019-11-15 20:44:13,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-11-15 20:44:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 992. [2019-11-15 20:44:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-15 20:44:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1532 transitions. [2019-11-15 20:44:13,692 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1532 transitions. Word has length 120 [2019-11-15 20:44:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:13,693 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1532 transitions. [2019-11-15 20:44:13,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1532 transitions. [2019-11-15 20:44:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 20:44:13,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:13,698 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 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-15 20:44:13,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:13,909 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1089696684, now seen corresponding path program 1 times [2019-11-15 20:44:13,909 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:44:13,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [786519487] [2019-11-15 20:44:13,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:44:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:16,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:16,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:16,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:16,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:16,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:16,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:16,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,833 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-15 20:44:16,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 184 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 20:44:16,872 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:16,919 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 18 [2019-11-15 20:44:16,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,924 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,926 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-15 20:44:16,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 20:44:16,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [786519487] [2019-11-15 20:44:16,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:44:16,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:44:16,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818712981] [2019-11-15 20:44:16,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:16,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:16,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:16,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:16,953 INFO L87 Difference]: Start difference. First operand 992 states and 1532 transitions. Second operand 4 states. [2019-11-15 20:44:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:21,223 INFO L93 Difference]: Finished difference Result 2581 states and 3949 transitions. [2019-11-15 20:44:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:21,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-15 20:44:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:21,236 INFO L225 Difference]: With dead ends: 2581 [2019-11-15 20:44:21,236 INFO L226 Difference]: Without dead ends: 1596 [2019-11-15 20:44:21,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2019-11-15 20:44:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1100. [2019-11-15 20:44:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-11-15 20:44:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1705 transitions. [2019-11-15 20:44:21,291 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1705 transitions. Word has length 137 [2019-11-15 20:44:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:21,292 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 1705 transitions. [2019-11-15 20:44:21,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1705 transitions. [2019-11-15 20:44:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 20:44:21,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:21,296 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 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-15 20:44:21,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:21,507 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1676583451, now seen corresponding path program 1 times [2019-11-15 20:44:21,508 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:44:21,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [530741711] [2019-11-15 20:44:21,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:44:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:24,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:24,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:24,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:24,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:24,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:24,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:24,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:24,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:24,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:24,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:24,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:24,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:24,544 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-15 20:44:24,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 189 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 20:44:24,590 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:24,632 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 18 [2019-11-15 20:44:24,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:24,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:24,639 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:24,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:24,640 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-15 20:44:24,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 20:44:24,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [530741711] [2019-11-15 20:44:24,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:44:24,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:44:24,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28588862] [2019-11-15 20:44:24,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:24,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:24,666 INFO L87 Difference]: Start difference. First operand 1100 states and 1705 transitions. Second operand 4 states. [2019-11-15 20:44:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:29,371 INFO L93 Difference]: Finished difference Result 2667 states and 4080 transitions. [2019-11-15 20:44:29,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:29,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-15 20:44:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:29,387 INFO L225 Difference]: With dead ends: 2667 [2019-11-15 20:44:29,388 INFO L226 Difference]: Without dead ends: 1574 [2019-11-15 20:44:29,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-11-15 20:44:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1100. [2019-11-15 20:44:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-11-15 20:44:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1692 transitions. [2019-11-15 20:44:29,448 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1692 transitions. Word has length 138 [2019-11-15 20:44:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:29,448 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 1692 transitions. [2019-11-15 20:44:29,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1692 transitions. [2019-11-15 20:44:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 20:44:29,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:29,453 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 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] [2019-11-15 20:44:29,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:29,665 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1941607728, now seen corresponding path program 1 times [2019-11-15 20:44:29,666 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:44:29,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [23138114] [2019-11-15 20:44:29,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:44:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:33,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:33,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:33,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:33,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:33,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:33,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:33,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:33,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:33,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:33,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:33,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:33,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:33,522 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-15 20:44:33,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 235 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 20:44:33,592 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:33,638 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 18 [2019-11-15 20:44:33,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:33,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:33,647 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:33,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:33,648 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-15 20:44:33,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 20:44:33,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [23138114] [2019-11-15 20:44:33,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:44:33,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:44:33,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052514527] [2019-11-15 20:44:33,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:33,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:33,673 INFO L87 Difference]: Start difference. First operand 1100 states and 1692 transitions. Second operand 4 states. [2019-11-15 20:44:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:38,726 INFO L93 Difference]: Finished difference Result 2673 states and 4072 transitions. [2019-11-15 20:44:38,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:38,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 20:44:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:38,738 INFO L225 Difference]: With dead ends: 2673 [2019-11-15 20:44:38,738 INFO L226 Difference]: Without dead ends: 1721 [2019-11-15 20:44:38,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-15 20:44:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1212. [2019-11-15 20:44:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-11-15 20:44:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1862 transitions. [2019-11-15 20:44:38,794 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1862 transitions. Word has length 152 [2019-11-15 20:44:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:38,795 INFO L462 AbstractCegarLoop]: Abstraction has 1212 states and 1862 transitions. [2019-11-15 20:44:38,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1862 transitions. [2019-11-15 20:44:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 20:44:38,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:38,800 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 4, 4, 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] [2019-11-15 20:44:39,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:39,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:39,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1691511138, now seen corresponding path program 1 times [2019-11-15 20:44:39,015 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:44:39,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2064954752] [2019-11-15 20:44:39,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:44:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:42,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:42,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:42,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:42,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:42,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:42,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:42,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:42,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:42,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:42,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:42,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:42,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:42,811 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-15 20:44:42,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 20:44:42,852 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:42,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 20 treesize of output 18 [2019-11-15 20:44:42,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:42,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:42,885 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:42,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:42,887 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-15 20:44:42,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 20:44:42,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064954752] [2019-11-15 20:44:42,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:44:42,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:44:42,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592925911] [2019-11-15 20:44:42,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:42,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:42,907 INFO L87 Difference]: Start difference. First operand 1212 states and 1862 transitions. Second operand 4 states. [2019-11-15 20:44:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:46,501 INFO L93 Difference]: Finished difference Result 2749 states and 4174 transitions. [2019-11-15 20:44:46,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:46,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 20:44:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:46,513 INFO L225 Difference]: With dead ends: 2749 [2019-11-15 20:44:46,513 INFO L226 Difference]: Without dead ends: 1701 [2019-11-15 20:44:46,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2019-11-15 20:44:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1219. [2019-11-15 20:44:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-11-15 20:44:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1857 transitions. [2019-11-15 20:44:46,568 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1857 transitions. Word has length 154 [2019-11-15 20:44:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:46,569 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 1857 transitions. [2019-11-15 20:44:46,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1857 transitions. [2019-11-15 20:44:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 20:44:46,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:46,574 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:46,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:44:46,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:46,787 INFO L82 PathProgramCache]: Analyzing trace with hash 382967436, now seen corresponding path program 1 times [2019-11-15 20:44:46,788 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:44:46,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [890530144] [2019-11-15 20:44:46,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:44:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:49,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:44:49,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:49,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:49,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:44:49,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:49,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:49,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:49,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:44:49,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:49,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:44:49,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:49,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:49,088 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-15 20:44:49,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:44:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:44:49,184 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:44:49,210 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 18 [2019-11-15 20:44:49,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:49,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:49,214 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:49,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:49,215 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-15 20:44:49,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:44:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:44:49,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [890530144] [2019-11-15 20:44:49,243 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:49,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:44:49,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006341858] [2019-11-15 20:44:49,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:44:49,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:44:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:44:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:44:49,245 INFO L87 Difference]: Start difference. First operand 1219 states and 1857 transitions. Second operand 7 states. [2019-11-15 20:45:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:00,698 INFO L93 Difference]: Finished difference Result 3535 states and 5300 transitions. [2019-11-15 20:45:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:00,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-11-15 20:45:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:00,714 INFO L225 Difference]: With dead ends: 3535 [2019-11-15 20:45:00,714 INFO L226 Difference]: Without dead ends: 2323 [2019-11-15 20:45:00,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-11-15 20:45:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1485. [2019-11-15 20:45:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-11-15 20:45:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2291 transitions. [2019-11-15 20:45:00,791 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2291 transitions. Word has length 169 [2019-11-15 20:45:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:00,792 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 2291 transitions. [2019-11-15 20:45:00,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2291 transitions. [2019-11-15 20:45:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 20:45:00,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:00,797 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:01,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:01,008 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1370109909, now seen corresponding path program 1 times [2019-11-15 20:45:01,010 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:01,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2010726137] [2019-11-15 20:45:01,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:03,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:03,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:03,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:03,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:03,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:03,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:03,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:03,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:03,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:03,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:03,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:03,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:03,495 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-15 20:45:03,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:45:03,548 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:03,579 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 18 [2019-11-15 20:45:03,581 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:03,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:03,583 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:03,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:03,584 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-15 20:45:03,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:45:03,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010726137] [2019-11-15 20:45:03,613 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:03,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:45:03,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583427697] [2019-11-15 20:45:03,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:03,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:03,615 INFO L87 Difference]: Start difference. First operand 1485 states and 2291 transitions. Second operand 7 states. [2019-11-15 20:45:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:13,020 INFO L93 Difference]: Finished difference Result 3894 states and 5919 transitions. [2019-11-15 20:45:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:13,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-11-15 20:45:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:13,035 INFO L225 Difference]: With dead ends: 3894 [2019-11-15 20:45:13,035 INFO L226 Difference]: Without dead ends: 2416 [2019-11-15 20:45:13,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2019-11-15 20:45:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1597. [2019-11-15 20:45:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1597 states. [2019-11-15 20:45:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2508 transitions. [2019-11-15 20:45:13,111 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2508 transitions. Word has length 170 [2019-11-15 20:45:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:13,112 INFO L462 AbstractCegarLoop]: Abstraction has 1597 states and 2508 transitions. [2019-11-15 20:45:13,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2508 transitions. [2019-11-15 20:45:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 20:45:13,117 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:13,117 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:13,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:13,335 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:13,336 INFO L82 PathProgramCache]: Analyzing trace with hash -795125565, now seen corresponding path program 1 times [2019-11-15 20:45:13,336 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:13,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1197789749] [2019-11-15 20:45:13,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:14,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:14,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:14,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:14,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:14,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:14,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:14,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:14,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:14,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:14,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:14,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:14,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:14,243 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-15 20:45:14,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:45:14,311 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:14,337 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 18 [2019-11-15 20:45:14,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:14,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:14,341 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:14,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:14,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-15 20:45:14,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:45:14,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1197789749] [2019-11-15 20:45:14,374 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:14,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:45:14,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646220024] [2019-11-15 20:45:14,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:14,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:14,376 INFO L87 Difference]: Start difference. First operand 1597 states and 2508 transitions. Second operand 7 states. [2019-11-15 20:45:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:25,940 INFO L93 Difference]: Finished difference Result 4233 states and 6505 transitions. [2019-11-15 20:45:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:25,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-11-15 20:45:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:25,959 INFO L225 Difference]: With dead ends: 4233 [2019-11-15 20:45:25,960 INFO L226 Difference]: Without dead ends: 2630 [2019-11-15 20:45:25,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2019-11-15 20:45:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1891. [2019-11-15 20:45:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-11-15 20:45:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2991 transitions. [2019-11-15 20:45:26,042 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2991 transitions. Word has length 172 [2019-11-15 20:45:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:26,043 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 2991 transitions. [2019-11-15 20:45:26,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2991 transitions. [2019-11-15 20:45:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 20:45:26,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:26,049 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 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] [2019-11-15 20:45:26,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:26,257 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1797784256, now seen corresponding path program 1 times [2019-11-15 20:45:26,259 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:26,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1473249801] [2019-11-15 20:45:26,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:28,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:28,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:28,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:28,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:28,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:28,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:28,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:28,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:28,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:28,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:28,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:28,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:28,438 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-15 20:45:28,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 284 proven. 5 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:28,480 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:28,525 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 18 [2019-11-15 20:45:28,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:28,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:28,529 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:28,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:28,534 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-15 20:45:28,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:28,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1473249801] [2019-11-15 20:45:28,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:28,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:45:28,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875778359] [2019-11-15 20:45:28,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:28,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:28,610 INFO L87 Difference]: Start difference. First operand 1891 states and 2991 transitions. Second operand 4 states. [2019-11-15 20:45:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:33,541 INFO L93 Difference]: Finished difference Result 4163 states and 6476 transitions. [2019-11-15 20:45:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:33,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 20:45:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:33,556 INFO L225 Difference]: With dead ends: 4163 [2019-11-15 20:45:33,556 INFO L226 Difference]: Without dead ends: 2279 [2019-11-15 20:45:33,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-11-15 20:45:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1894. [2019-11-15 20:45:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-15 20:45:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2955 transitions. [2019-11-15 20:45:33,636 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2955 transitions. Word has length 180 [2019-11-15 20:45:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:33,637 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2955 transitions. [2019-11-15 20:45:33,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2955 transitions. [2019-11-15 20:45:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 20:45:33,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:33,643 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 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-15 20:45:33,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:33,855 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash 85318882, now seen corresponding path program 1 times [2019-11-15 20:45:33,856 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:33,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [432919157] [2019-11-15 20:45:33,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:35,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:35,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:35,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:35,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:35,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:35,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:35,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:35,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:35,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:35,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:35,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:35,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:35,886 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-15 20:45:35,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 292 proven. 4 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:35,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:35,949 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 18 [2019-11-15 20:45:35,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:35,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:35,953 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:35,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:35,954 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-15 20:45:35,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:35,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [432919157] [2019-11-15 20:45:35,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:35,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:45:35,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444512124] [2019-11-15 20:45:35,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:35,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:35,980 INFO L87 Difference]: Start difference. First operand 1894 states and 2955 transitions. Second operand 4 states. [2019-11-15 20:45:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:39,994 INFO L93 Difference]: Finished difference Result 4134 states and 6346 transitions. [2019-11-15 20:45:39,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:39,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 20:45:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:40,006 INFO L225 Difference]: With dead ends: 4134 [2019-11-15 20:45:40,006 INFO L226 Difference]: Without dead ends: 2250 [2019-11-15 20:45:40,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-11-15 20:45:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1894. [2019-11-15 20:45:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-15 20:45:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2915 transitions. [2019-11-15 20:45:40,082 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2915 transitions. Word has length 180 [2019-11-15 20:45:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:40,082 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2915 transitions. [2019-11-15 20:45:40,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2915 transitions. [2019-11-15 20:45:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 20:45:40,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:40,089 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 4, 4, 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-15 20:45:40,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:40,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1168716665, now seen corresponding path program 1 times [2019-11-15 20:45:40,301 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:40,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [988866344] [2019-11-15 20:45:40,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:42,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:42,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:42,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:42,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:42,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:42,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:42,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:42,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:42,464 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:42,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:42,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:42,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:42,471 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-15 20:45:42,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 300 proven. 4 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:42,530 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:42,643 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 18 [2019-11-15 20:45:42,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:42,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:42,647 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:42,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:42,648 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-15 20:45:42,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:42,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988866344] [2019-11-15 20:45:42,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:42,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:45:42,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243338017] [2019-11-15 20:45:42,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:42,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:42,673 INFO L87 Difference]: Start difference. First operand 1894 states and 2915 transitions. Second operand 4 states. [2019-11-15 20:45:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:47,045 INFO L93 Difference]: Finished difference Result 4134 states and 6266 transitions. [2019-11-15 20:45:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:47,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 20:45:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:47,060 INFO L225 Difference]: With dead ends: 4134 [2019-11-15 20:45:47,060 INFO L226 Difference]: Without dead ends: 2250 [2019-11-15 20:45:47,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-11-15 20:45:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1894. [2019-11-15 20:45:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-15 20:45:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2875 transitions. [2019-11-15 20:45:47,137 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2875 transitions. Word has length 181 [2019-11-15 20:45:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:47,137 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2875 transitions. [2019-11-15 20:45:47,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2875 transitions. [2019-11-15 20:45:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 20:45:47,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:47,143 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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-15 20:45:47,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:47,358 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2138933149, now seen corresponding path program 1 times [2019-11-15 20:45:47,359 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:47,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [260298373] [2019-11-15 20:45:47,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:49,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:49,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:49,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:49,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:49,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:49,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:49,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:49,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:49,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:49,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:49,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:49,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:49,446 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-15 20:45:49,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 308 proven. 4 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:49,502 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:49,534 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 18 [2019-11-15 20:45:49,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:49,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:49,537 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:49,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:49,537 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-15 20:45:49,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:49,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [260298373] [2019-11-15 20:45:49,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:49,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:45:49,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180714310] [2019-11-15 20:45:49,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:49,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:49,561 INFO L87 Difference]: Start difference. First operand 1894 states and 2875 transitions. Second operand 4 states. [2019-11-15 20:45:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:54,838 INFO L93 Difference]: Finished difference Result 4134 states and 6186 transitions. [2019-11-15 20:45:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:54,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 20:45:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:54,846 INFO L225 Difference]: With dead ends: 4134 [2019-11-15 20:45:54,846 INFO L226 Difference]: Without dead ends: 2250 [2019-11-15 20:45:54,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-11-15 20:45:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1894. [2019-11-15 20:45:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-15 20:45:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2835 transitions. [2019-11-15 20:45:54,931 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2835 transitions. Word has length 182 [2019-11-15 20:45:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:54,931 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2835 transitions. [2019-11-15 20:45:54,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2835 transitions. [2019-11-15 20:45:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 20:45:54,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:54,935 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 4, 4, 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-15 20:45:55,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:45:55,147 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:55,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash -399470636, now seen corresponding path program 1 times [2019-11-15 20:45:55,148 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:45:55,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1032152123] [2019-11-15 20:45:55,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:45:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:45:57,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:57,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:45:57,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:45:57,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:57,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:57,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:57,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:45:57,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:57,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:45:57,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:57,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:57,220 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-15 20:45:57,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:45:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 316 proven. 4 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:57,320 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:45:57,339 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 18 [2019-11-15 20:45:57,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:57,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:57,341 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:57,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45: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-15 20:45:57,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:45:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:45:57,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032152123] [2019-11-15 20:45:57,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:57,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:45:57,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677735546] [2019-11-15 20:45:57,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:57,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:45:57,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:57,361 INFO L87 Difference]: Start difference. First operand 1894 states and 2835 transitions. Second operand 4 states. [2019-11-15 20:46:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:02,037 INFO L93 Difference]: Finished difference Result 4134 states and 6106 transitions. [2019-11-15 20:46:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:02,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 20:46:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:02,044 INFO L225 Difference]: With dead ends: 4134 [2019-11-15 20:46:02,044 INFO L226 Difference]: Without dead ends: 2250 [2019-11-15 20:46:02,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:46:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-11-15 20:46:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1894. [2019-11-15 20:46:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-15 20:46:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2795 transitions. [2019-11-15 20:46:02,132 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2795 transitions. Word has length 183 [2019-11-15 20:46:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:02,132 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2795 transitions. [2019-11-15 20:46:02,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:46:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2795 transitions. [2019-11-15 20:46:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 20:46:02,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:02,135 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:02,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:46:02,336 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash 338044857, now seen corresponding path program 1 times [2019-11-15 20:46:02,337 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:46:02,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1705999716] [2019-11-15 20:46:02,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:46:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:46:06,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:06,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:06,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:46:06,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:06,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:06,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:06,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:46:06,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:06,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:46:06,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:06,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:06,106 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-15 20:46:06,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:46:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:06,190 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:46:06,234 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 18 [2019-11-15 20:46:06,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:06,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:06,238 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:06,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:06,239 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-15 20:46:06,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:46:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:06,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705999716] [2019-11-15 20:46:06,283 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:06,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:46:06,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962824838] [2019-11-15 20:46:06,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:06,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:46:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:06,289 INFO L87 Difference]: Start difference. First operand 1894 states and 2795 transitions. Second operand 7 states. [2019-11-15 20:46:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:15,997 INFO L93 Difference]: Finished difference Result 4801 states and 6997 transitions. [2019-11-15 20:46:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:46:15,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-11-15 20:46:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:16,004 INFO L225 Difference]: With dead ends: 4801 [2019-11-15 20:46:16,004 INFO L226 Difference]: Without dead ends: 2917 [2019-11-15 20:46:16,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:46:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-11-15 20:46:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2125. [2019-11-15 20:46:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-11-15 20:46:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3117 transitions. [2019-11-15 20:46:16,069 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3117 transitions. Word has length 200 [2019-11-15 20:46:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:16,070 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 3117 transitions. [2019-11-15 20:46:16,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3117 transitions. [2019-11-15 20:46:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 20:46:16,073 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:16,074 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:16,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:46:16,275 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 690848662, now seen corresponding path program 1 times [2019-11-15 20:46:16,276 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:46:16,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1592089349] [2019-11-15 20:46:16,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:46:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:46:19,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:19,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:19,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:46:19,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:19,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:19,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:19,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:46:19,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:19,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:46:19,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:19,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:19,430 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-15 20:46:19,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:46:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:19,491 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:46:19,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 20 treesize of output 18 [2019-11-15 20:46:19,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:19,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:19,539 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:19,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:19,540 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-15 20:46:19,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:46:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:19,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1592089349] [2019-11-15 20:46:19,584 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:19,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:46:19,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624201761] [2019-11-15 20:46:19,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:19,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:46:19,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:19,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:19,587 INFO L87 Difference]: Start difference. First operand 2125 states and 3117 transitions. Second operand 7 states. [2019-11-15 20:46:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:29,575 INFO L93 Difference]: Finished difference Result 5256 states and 7621 transitions. [2019-11-15 20:46:29,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:46:29,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-11-15 20:46:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:29,583 INFO L225 Difference]: With dead ends: 5256 [2019-11-15 20:46:29,583 INFO L226 Difference]: Without dead ends: 3141 [2019-11-15 20:46:29,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:46:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2019-11-15 20:46:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2363. [2019-11-15 20:46:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-15 20:46:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3453 transitions. [2019-11-15 20:46:29,688 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3453 transitions. Word has length 200 [2019-11-15 20:46:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:29,688 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3453 transitions. [2019-11-15 20:46:29,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3453 transitions. [2019-11-15 20:46:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 20:46:29,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:29,694 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:29,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:46:29,910 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1015241072, now seen corresponding path program 1 times [2019-11-15 20:46:29,911 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:46:29,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2060995979] [2019-11-15 20:46:29,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:46:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:33,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:46:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:33,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:33,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:46:33,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:33,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:33,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:33,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:46:33,646 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:33,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:46:33,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:33,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:33,654 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-15 20:46:33,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:46:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:33,787 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:46:33,824 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 18 [2019-11-15 20:46:33,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:33,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:33,827 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:33,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:33,828 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-15 20:46:33,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:46:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:33,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2060995979] [2019-11-15 20:46:33,861 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:33,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:46:33,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096788488] [2019-11-15 20:46:33,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:33,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:46:33,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:33,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:33,862 INFO L87 Difference]: Start difference. First operand 2363 states and 3453 transitions. Second operand 7 states. [2019-11-15 20:46:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:44,273 INFO L93 Difference]: Finished difference Result 5427 states and 7829 transitions. [2019-11-15 20:46:44,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:46:44,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-11-15 20:46:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:44,282 INFO L225 Difference]: With dead ends: 5427 [2019-11-15 20:46:44,283 INFO L226 Difference]: Without dead ends: 3074 [2019-11-15 20:46:44,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:46:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2019-11-15 20:46:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2363. [2019-11-15 20:46:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-15 20:46:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3425 transitions. [2019-11-15 20:46:44,386 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3425 transitions. Word has length 201 [2019-11-15 20:46:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:44,387 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3425 transitions. [2019-11-15 20:46:44,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3425 transitions. [2019-11-15 20:46:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 20:46:44,391 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:44,392 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:44,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:46:44,613 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 124147149, now seen corresponding path program 1 times [2019-11-15 20:46:44,614 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:46:44,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [322137493] [2019-11-15 20:46:44,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:46:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:47,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:46:47,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:47,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:47,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:46:47,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:47,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:47,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:47,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:46:47,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:47,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:46:47,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:47,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:47,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-15 20:46:47,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:46:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:47,954 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:46:47,983 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 18 [2019-11-15 20:46:47,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:47,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:47,987 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:47,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:47,988 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-15 20:46:47,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:46:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:46:48,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322137493] [2019-11-15 20:46:48,055 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:48,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:46:48,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324381073] [2019-11-15 20:46:48,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:46:48,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:46:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:46:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:46:48,056 INFO L87 Difference]: Start difference. First operand 2363 states and 3425 transitions. Second operand 7 states. [2019-11-15 20:46:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:55,912 INFO L93 Difference]: Finished difference Result 5415 states and 7755 transitions. [2019-11-15 20:46:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:46:55,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-11-15 20:46:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:55,917 INFO L225 Difference]: With dead ends: 5415 [2019-11-15 20:46:55,917 INFO L226 Difference]: Without dead ends: 3062 [2019-11-15 20:46:55,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:46:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-11-15 20:46:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2363. [2019-11-15 20:46:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-15 20:46:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3404 transitions. [2019-11-15 20:46:55,990 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3404 transitions. Word has length 201 [2019-11-15 20:46:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:55,990 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3404 transitions. [2019-11-15 20:46:55,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:46:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3404 transitions. [2019-11-15 20:46:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 20:46:55,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:55,995 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:56,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:46:56,206 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:56,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1210805923, now seen corresponding path program 1 times [2019-11-15 20:46:56,207 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:46:56,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [564178415] [2019-11-15 20:46:56,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:46:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:57,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:46:57,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:57,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,736 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 23 treesize of output 22 [2019-11-15 20:46:57,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 20:46:57,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 20:46:57,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-15 20:46:57,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 37 [2019-11-15 20:46:57,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2019-11-15 20:46:57,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:57,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 37 [2019-11-15 20:46:57,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2019-11-15 20:46:57,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,917 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 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 20:46:57,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:57,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:57,920 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-15 20:46:57,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2019-11-15 20:46:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 326 proven. 47 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 20:46:58,100 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:46:58,239 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 25 treesize of output 21 [2019-11-15 20:46:58,243 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 25 treesize of output 17 [2019-11-15 20:46:58,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:58,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:58,246 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:58,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:58,247 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-15 20:46:58,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2019-11-15 20:46:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 20:46:58,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [564178415] [2019-11-15 20:46:58,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:46:58,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-15 20:46:58,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583434370] [2019-11-15 20:46:58,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:46:58,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:46:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:46:58,324 INFO L87 Difference]: Start difference. First operand 2363 states and 3404 transitions. Second operand 5 states. [2019-11-15 20:47:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:07,794 INFO L93 Difference]: Finished difference Result 5786 states and 8295 transitions. [2019-11-15 20:47:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:47:07,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-11-15 20:47:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:07,807 INFO L225 Difference]: With dead ends: 5786 [2019-11-15 20:47:07,808 INFO L226 Difference]: Without dead ends: 3433 [2019-11-15 20:47:07,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:47:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-11-15 20:47:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3401. [2019-11-15 20:47:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2019-11-15 20:47:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4863 transitions. [2019-11-15 20:47:07,948 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4863 transitions. Word has length 208 [2019-11-15 20:47:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:07,949 INFO L462 AbstractCegarLoop]: Abstraction has 3401 states and 4863 transitions. [2019-11-15 20:47:07,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:47:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4863 transitions. [2019-11-15 20:47:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-15 20:47:07,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:07,955 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:08,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:47:08,164 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -705432987, now seen corresponding path program 1 times [2019-11-15 20:47:08,166 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:47:08,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1103166456] [2019-11-15 20:47:08,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:47:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:10,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:47:10,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:10,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:47:10,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:47:10,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:10,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:10,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:10,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:47:10,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:10,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:47:10,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:10,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:10,438 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-15 20:47:10,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:47:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:47:10,534 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:47:10,574 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 18 [2019-11-15 20:47:10,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:10,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:10,578 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:10,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:10,579 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-15 20:47:10,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:47:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:47:10,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1103166456] [2019-11-15 20:47:10,619 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:10,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:47:10,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376784856] [2019-11-15 20:47:10,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:47:10,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:47:10,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:47:10,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:47:10,620 INFO L87 Difference]: Start difference. First operand 3401 states and 4863 transitions. Second operand 7 states. [2019-11-15 20:47:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:19,527 INFO L93 Difference]: Finished difference Result 7732 states and 10951 transitions. [2019-11-15 20:47:19,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:47:19,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-11-15 20:47:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:19,532 INFO L225 Difference]: With dead ends: 7732 [2019-11-15 20:47:19,532 INFO L226 Difference]: Without dead ends: 4341 [2019-11-15 20:47:19,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:47:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-11-15 20:47:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 3408. [2019-11-15 20:47:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3408 states. [2019-11-15 20:47:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 4857 transitions. [2019-11-15 20:47:19,687 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 4857 transitions. Word has length 209 [2019-11-15 20:47:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:19,688 INFO L462 AbstractCegarLoop]: Abstraction has 3408 states and 4857 transitions. [2019-11-15 20:47:19,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:47:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 4857 transitions. [2019-11-15 20:47:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-15 20:47:19,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:19,694 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:19,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:47:19,906 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -359360690, now seen corresponding path program 1 times [2019-11-15 20:47:19,907 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:47:19,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [912843635] [2019-11-15 20:47:19,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:47:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:21,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:47:21,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:21,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:47:21,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:47:21,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:21,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:21,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:21,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:47:22,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:22,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:47:22,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:22,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:22,012 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-15 20:47:22,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:47:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:47:22,093 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:47:22,134 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 18 [2019-11-15 20:47:22,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:22,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:22,138 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:22,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:22,139 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-15 20:47:22,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:47:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 20:47:22,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912843635] [2019-11-15 20:47:22,178 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:22,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:47:22,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79458547] [2019-11-15 20:47:22,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:47:22,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:47:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:47:22,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:47:22,179 INFO L87 Difference]: Start difference. First operand 3408 states and 4857 transitions. Second operand 7 states. [2019-11-15 20:47:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:28,989 INFO L93 Difference]: Finished difference Result 7713 states and 10888 transitions. [2019-11-15 20:47:28,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:47:28,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2019-11-15 20:47:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:28,994 INFO L225 Difference]: With dead ends: 7713 [2019-11-15 20:47:28,994 INFO L226 Difference]: Without dead ends: 4315 [2019-11-15 20:47:28,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:47:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2019-11-15 20:47:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 3415. [2019-11-15 20:47:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-11-15 20:47:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4851 transitions. [2019-11-15 20:47:29,143 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4851 transitions. Word has length 210 [2019-11-15 20:47:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:29,143 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 4851 transitions. [2019-11-15 20:47:29,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:47:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4851 transitions. [2019-11-15 20:47:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-15 20:47:29,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:29,148 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:29,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:47:29,349 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1646677507, now seen corresponding path program 1 times [2019-11-15 20:47:29,350 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:47:29,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1535121037] [2019-11-15 20:47:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:47:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:33,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:47:33,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:33,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:47:33,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:47:33,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:33,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:33,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:33,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:47:33,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:33,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:47:33,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:33,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:33,350 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-15 20:47:33,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:47:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:47:33,412 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:47:33,436 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 18 [2019-11-15 20:47:33,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:33,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:33,439 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:33,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:33,440 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-15 20:47:33,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:47:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:47:33,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1535121037] [2019-11-15 20:47:33,476 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:33,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:47:33,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457274352] [2019-11-15 20:47:33,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:47:33,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:47:33,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:47:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:47:33,478 INFO L87 Difference]: Start difference. First operand 3415 states and 4851 transitions. Second operand 7 states. [2019-11-15 20:47:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:44,207 INFO L93 Difference]: Finished difference Result 8240 states and 11553 transitions. [2019-11-15 20:47:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:47:44,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2019-11-15 20:47:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:44,211 INFO L225 Difference]: With dead ends: 8240 [2019-11-15 20:47:44,212 INFO L226 Difference]: Without dead ends: 4835 [2019-11-15 20:47:44,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:47:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2019-11-15 20:47:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 3701. [2019-11-15 20:47:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-11-15 20:47:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5188 transitions. [2019-11-15 20:47:44,330 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5188 transitions. Word has length 225 [2019-11-15 20:47:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:44,331 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 5188 transitions. [2019-11-15 20:47:44,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:47:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5188 transitions. [2019-11-15 20:47:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-15 20:47:44,336 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:44,336 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:44,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:47:44,538 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2014959968, now seen corresponding path program 1 times [2019-11-15 20:47:44,539 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:47:44,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1918960722] [2019-11-15 20:47:44,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:47:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:47,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:47:47,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:47,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:47:47,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:47:47,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:47,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:47,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:47,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:47:47,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:47,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:47:47,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:47,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:47,450 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-15 20:47:47,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:47:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:47:47,533 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:47:47,563 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 18 [2019-11-15 20:47:47,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:47,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:47,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:47,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:47,568 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-15 20:47:47,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:47:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:47:47,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1918960722] [2019-11-15 20:47:47,604 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:47,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:47:47,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300161379] [2019-11-15 20:47:47,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:47:47,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:47:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:47:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:47:47,606 INFO L87 Difference]: Start difference. First operand 3701 states and 5188 transitions. Second operand 7 states. [2019-11-15 20:47:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:59,922 INFO L93 Difference]: Finished difference Result 8907 states and 12332 transitions. [2019-11-15 20:47:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:47:59,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2019-11-15 20:47:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:59,927 INFO L225 Difference]: With dead ends: 8907 [2019-11-15 20:47:59,927 INFO L226 Difference]: Without dead ends: 5216 [2019-11-15 20:47:59,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:47:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-11-15 20:48:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 4065. [2019-11-15 20:48:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2019-11-15 20:48:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 5636 transitions. [2019-11-15 20:48:00,056 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 5636 transitions. Word has length 225 [2019-11-15 20:48:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:00,057 INFO L462 AbstractCegarLoop]: Abstraction has 4065 states and 5636 transitions. [2019-11-15 20:48:00,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:48:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 5636 transitions. [2019-11-15 20:48:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 20:48:00,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:00,062 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:00,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:48:00,263 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 463407398, now seen corresponding path program 1 times [2019-11-15 20:48:00,264 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:48:00,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1875643629] [2019-11-15 20:48:00,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:48:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:04,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:48:04,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:04,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:48:04,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:48:04,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:04,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:04,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:04,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:48:04,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:04,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:48:04,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:04,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:04,316 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-15 20:48:04,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:48:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:04,369 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:48:04,398 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 18 [2019-11-15 20:48:04,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:04,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:04,402 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:04,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:04,404 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-15 20:48:04,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:48:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:04,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1875643629] [2019-11-15 20:48:04,445 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:04,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:48:04,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666463909] [2019-11-15 20:48:04,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:48:04,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:48:04,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:48:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:48:04,447 INFO L87 Difference]: Start difference. First operand 4065 states and 5636 transitions. Second operand 7 states. [2019-11-15 20:48:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:16,762 INFO L93 Difference]: Finished difference Result 8980 states and 12344 transitions. [2019-11-15 20:48:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:48:16,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2019-11-15 20:48:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:16,767 INFO L225 Difference]: With dead ends: 8980 [2019-11-15 20:48:16,767 INFO L226 Difference]: Without dead ends: 4925 [2019-11-15 20:48:16,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:48:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2019-11-15 20:48:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4048. [2019-11-15 20:48:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4048 states. [2019-11-15 20:48:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5541 transitions. [2019-11-15 20:48:16,894 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5541 transitions. Word has length 226 [2019-11-15 20:48:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:16,894 INFO L462 AbstractCegarLoop]: Abstraction has 4048 states and 5541 transitions. [2019-11-15 20:48:16,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:48:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5541 transitions. [2019-11-15 20:48:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 20:48:16,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:16,899 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:17,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:48:17,100 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 562721065, now seen corresponding path program 1 times [2019-11-15 20:48:17,101 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:48:17,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1588748224] [2019-11-15 20:48:17,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:48:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:19,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:48:19,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:19,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:48:19,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:48:19,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:19,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:19,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:19,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:48:19,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:19,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:48:19,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:19,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:19,859 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-15 20:48:19,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:48:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:19,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:48:19,951 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 18 [2019-11-15 20:48:19,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:19,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:19,953 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:19,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:19,954 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-15 20:48:19,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:48:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:20,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588748224] [2019-11-15 20:48:20,036 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:20,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:48:20,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143823394] [2019-11-15 20:48:20,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:48:20,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:48:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:48:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:48:20,037 INFO L87 Difference]: Start difference. First operand 4048 states and 5541 transitions. Second operand 7 states. [2019-11-15 20:48:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:29,868 INFO L93 Difference]: Finished difference Result 8934 states and 12129 transitions. [2019-11-15 20:48:29,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:48:29,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2019-11-15 20:48:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:29,874 INFO L225 Difference]: With dead ends: 8934 [2019-11-15 20:48:29,874 INFO L226 Difference]: Without dead ends: 4912 [2019-11-15 20:48:29,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:48:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4912 states. [2019-11-15 20:48:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4912 to 4048. [2019-11-15 20:48:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4048 states. [2019-11-15 20:48:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5482 transitions. [2019-11-15 20:48:30,015 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5482 transitions. Word has length 226 [2019-11-15 20:48:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:30,015 INFO L462 AbstractCegarLoop]: Abstraction has 4048 states and 5482 transitions. [2019-11-15 20:48:30,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:48:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5482 transitions. [2019-11-15 20:48:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-15 20:48:30,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:30,023 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:30,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:48:30,234 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash 663366789, now seen corresponding path program 1 times [2019-11-15 20:48:30,235 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:48:30,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1531577513] [2019-11-15 20:48:30,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:48:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:33,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:48:33,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:33,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:48:33,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:48:33,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:33,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:33,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:33,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:48:33,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:33,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:48:33,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:33,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:33,131 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-15 20:48:33,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:48:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:33,262 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:48:33,286 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 18 [2019-11-15 20:48:33,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:33,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:33,289 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:33,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:33,290 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-15 20:48:33,290 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:48:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:33,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1531577513] [2019-11-15 20:48:33,327 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:33,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:48:33,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971100874] [2019-11-15 20:48:33,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:48:33,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:48:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:48:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:48:33,328 INFO L87 Difference]: Start difference. First operand 4048 states and 5482 transitions. Second operand 7 states. [2019-11-15 20:48:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:42,245 INFO L93 Difference]: Finished difference Result 8934 states and 12000 transitions. [2019-11-15 20:48:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:48:42,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 227 [2019-11-15 20:48:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:42,250 INFO L225 Difference]: With dead ends: 8934 [2019-11-15 20:48:42,250 INFO L226 Difference]: Without dead ends: 4912 [2019-11-15 20:48:42,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:48:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4912 states. [2019-11-15 20:48:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4912 to 4048. [2019-11-15 20:48:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4048 states. [2019-11-15 20:48:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5423 transitions. [2019-11-15 20:48:42,446 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5423 transitions. Word has length 227 [2019-11-15 20:48:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:42,446 INFO L462 AbstractCegarLoop]: Abstraction has 4048 states and 5423 transitions. [2019-11-15 20:48:42,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:48:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5423 transitions. [2019-11-15 20:48:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 20:48:42,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:42,452 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:42,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:48:42,652 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1658795694, now seen corresponding path program 1 times [2019-11-15 20:48:42,654 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:48:42,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [748567892] [2019-11-15 20:48:42,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:48:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:45,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:48:45,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:45,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:48:45,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:48:45,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:45,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:45,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:45,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:48:45,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:45,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:48:45,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:45,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:45,537 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-15 20:48:45,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:48:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:45,604 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:48:45,630 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 18 [2019-11-15 20:48:45,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:45,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:45,633 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:45,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:45,634 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-15 20:48:45,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 20:48:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:48:45,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [748567892] [2019-11-15 20:48:45,672 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:45,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 20:48:45,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513170691] [2019-11-15 20:48:45,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:48:45,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:48:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:48:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:48:45,674 INFO L87 Difference]: Start difference. First operand 4048 states and 5423 transitions. Second operand 7 states. [2019-11-15 20:48:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:55,449 INFO L93 Difference]: Finished difference Result 8801 states and 11704 transitions. [2019-11-15 20:48:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:48:55,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-11-15 20:48:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:55,453 INFO L225 Difference]: With dead ends: 8801 [2019-11-15 20:48:55,453 INFO L226 Difference]: Without dead ends: 4779 [2019-11-15 20:48:55,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:48:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2019-11-15 20:48:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 3937. [2019-11-15 20:48:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-11-15 20:48:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5222 transitions. [2019-11-15 20:48:55,583 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5222 transitions. Word has length 228 [2019-11-15 20:48:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:55,584 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 5222 transitions. [2019-11-15 20:48:55,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:48:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5222 transitions. [2019-11-15 20:48:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-15 20:48:55,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:55,589 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:55,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:48:55,790 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 271654138, now seen corresponding path program 1 times [2019-11-15 20:48:55,791 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:48:55,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1170007452] [2019-11-15 20:48:55,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:48:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:59,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:48:59,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:59,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:48:59,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:48:59,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:59,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:59,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:59,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:48:59,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:59,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:48:59,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:59,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:59,235 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-15 20:48:59,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:48:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-15 20:48:59,314 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:48:59,335 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 22 treesize of output 20 [2019-11-15 20:48:59,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:48:59,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:59,340 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:48:59,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:48:59,341 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-15 20:48:59,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 20:48:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-15 20:48:59,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1170007452] [2019-11-15 20:48:59,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:48:59,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:48:59,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505940031] [2019-11-15 20:48:59,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:48:59,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:48:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:48:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:48:59,388 INFO L87 Difference]: Start difference. First operand 3937 states and 5222 transitions. Second operand 4 states. [2019-11-15 20:49:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:49:02,622 INFO L93 Difference]: Finished difference Result 8635 states and 11375 transitions. [2019-11-15 20:49:02,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:49:02,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-11-15 20:49:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:49:02,626 INFO L225 Difference]: With dead ends: 8635 [2019-11-15 20:49:02,627 INFO L226 Difference]: Without dead ends: 4724 [2019-11-15 20:49:02,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:49:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2019-11-15 20:49:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4201. [2019-11-15 20:49:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2019-11-15 20:49:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 5494 transitions. [2019-11-15 20:49:02,768 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 5494 transitions. Word has length 247 [2019-11-15 20:49:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:49:02,769 INFO L462 AbstractCegarLoop]: Abstraction has 4201 states and 5494 transitions. [2019-11-15 20:49:02,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:49:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 5494 transitions. [2019-11-15 20:49:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 20:49:02,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:49:02,775 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:49:02,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:49:02,978 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:49:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:49:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash -173342143, now seen corresponding path program 1 times [2019-11-15 20:49:02,979 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:49:02,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [779518568] [2019-11-15 20:49:02,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:49:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:49:06,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:49:06,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:49:06,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:06,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 20:49:06,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:49:06,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:06,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:49:06,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 20:49:06,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:06,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 20:49:06,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:49:06,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:06,504 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-15 20:49:06,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 20:49:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 152 proven. 3 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-15 20:49:06,640 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:49:06,663 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 22 treesize of output 20 [2019-11-15 20:49:06,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:49:06,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:06,667 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:49:06,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:06,668 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-15 20:49:06,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 20:49:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-15 20:49:06,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [779518568] [2019-11-15 20:49:06,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:49:06,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:49:06,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796978933] [2019-11-15 20:49:06,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:49:06,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:49:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:49:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:49:06,727 INFO L87 Difference]: Start difference. First operand 4201 states and 5494 transitions. Second operand 4 states. [2019-11-15 20:49:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:49:11,595 INFO L93 Difference]: Finished difference Result 8492 states and 11091 transitions. [2019-11-15 20:49:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:49:11,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2019-11-15 20:49:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:49:11,600 INFO L225 Difference]: With dead ends: 8492 [2019-11-15 20:49:11,600 INFO L226 Difference]: Without dead ends: 4317 [2019-11-15 20:49:11,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:49:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-11-15 20:49:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4028. [2019-11-15 20:49:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-11-15 20:49:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 5199 transitions. [2019-11-15 20:49:11,738 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 5199 transitions. Word has length 248 [2019-11-15 20:49:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:49:11,738 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 5199 transitions. [2019-11-15 20:49:11,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:49:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 5199 transitions. [2019-11-15 20:49:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 20:49:11,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:49:11,743 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:49:11,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:49:11,945 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:49:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:49:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash 665324743, now seen corresponding path program 1 times [2019-11-15 20:49:11,946 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:49:11,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1127270133] [2019-11-15 20:49:11,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_371502cb-8205-42ed-96db-e69a8f07c2c0/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-15 20:49:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:49:21,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 20:49:21,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:49:32,821 INFO L235 Elim1Store]: Index analysis took 3348 ms [2019-11-15 20:49:32,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:32,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-15 20:49:32,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:49:46,179 WARN L191 SmtUtils]: Spent 13.34 s on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 20:49:46,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:49:46,184 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_338|, |v_#memory_$Pointer$.offset_332|], 2=[|v_#memory_$Pointer$.offset_324|, |v_#memory_$Pointer$.offset_325|, |v_#memory_$Pointer$.offset_326|, |v_#memory_$Pointer$.base_326|, |v_#memory_$Pointer$.base_325|, |v_#memory_$Pointer$.base_324|]} [2019-11-15 20:49:47,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:47,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:47,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:48,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:48,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:49,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:49:51,543 INFO L235 Elim1Store]: Index analysis took 4741 ms [2019-11-15 20:49:58,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 20:49:58,223 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:10,349 WARN L191 SmtUtils]: Spent 12.12 s on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 20:50:10,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:10,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:11,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:11,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:11,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:11,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:12,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:12,203 INFO L235 Elim1Store]: Index analysis took 1527 ms [2019-11-15 20:50:13,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 20:50:13,962 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:20,712 WARN L191 SmtUtils]: Spent 6.75 s on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 20:50:20,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:20,750 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-15 20:50:25,245 WARN L191 SmtUtils]: Spent 4.49 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 20:50:25,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:25,280 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-15 20:50:28,205 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 20:50:28,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:28,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:28,814 INFO L235 Elim1Store]: Index analysis took 552 ms [2019-11-15 20:50:28,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-15 20:50:28,817 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:29,893 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 20:50:29,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:29,905 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-15 20:50:30,538 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 20:50:30,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:30,546 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-15 20:50:31,119 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 20:50:31,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:31,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-15 20:50:31,171 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:31,281 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 20:50:31,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:31,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:50:31,282 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:91 [2019-11-15 20:50:31,321 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_333|], 12=[|v_#memory_$Pointer$.base_339|]} [2019-11-15 20:50:31,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 20:50:31,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:31,523 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 20:50:31,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:31,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:31,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-11-15 20:50:31,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:31,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:31,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:50:31,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-11-15 20:50:31,609 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_327|, |v_#memory_$Pointer$.offset_328|, |v_#memory_$Pointer$.base_327|, |v_#memory_$Pointer$.offset_334|], 6=[|v_#memory_$Pointer$.base_328|], 12=[|v_#memory_$Pointer$.base_340|]} [2019-11-15 20:50:31,653 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:50:32,530 WARN L191 SmtUtils]: Spent 877.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 20:50:32,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:32,541 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-15 20:50:33,011 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 20:50:33,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:33,017 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:50:33,329 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 20:50:33,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:33,364 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 79 treesize of output 73 [2019-11-15 20:50:33,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:33,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:33,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:33,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:50:33,433 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 53 treesize of output 41 [2019-11-15 20:50:33,434 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:50:33,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:33,439 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:50:33,762 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 20:50:33,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:33,767 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-15 20:50:34,198 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 20:50:34,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:50:34,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:50:34,401 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.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 20:50:34,406 INFO L168 Benchmark]: Toolchain (without parser) took 406085.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 948.3 MB in the beginning and 994.7 MB in the end (delta: -46.4 MB). Peak memory consumption was 238.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:34,407 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:50:34,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 976.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:34,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.88 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.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:34,408 INFO L168 Benchmark]: Boogie Preprocessor took 134.08 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.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:34,408 INFO L168 Benchmark]: RCFGBuilder took 5299.27 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: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:34,409 INFO L168 Benchmark]: TraceAbstraction took 399568.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.0 GB in the beginning and 994.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 159.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:34,411 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 976.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.88 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.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.08 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.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5299.27 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: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 399568.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.0 GB in the beginning and 994.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 159.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...